./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix010.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/mix010.oepc.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 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:01:26,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:01:26,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:01:26,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:01:26,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:01:26,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:01:26,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:01:26,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:01:26,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:01:26,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:01:26,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:01:26,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:01:26,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:01:26,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:01:26,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:01:26,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:01:26,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:01:26,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:01:26,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:01:26,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:01:26,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:01:26,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:01:26,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:01:26,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:01:26,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:01:26,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:01:26,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:01:26,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:01:26,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:01:26,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:01:26,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:01:26,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:01:26,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:01:26,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:01:26,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:01:26,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:01:26,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:01:26,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:01:26,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:01:26,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:01:26,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:01:26,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:01:26,832 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:01:26,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:01:26,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:01:26,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:01:26,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:01:26,833 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:01:26,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:01:26,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:01:26,834 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:01:26,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:01:26,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:01:26,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:01:26,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:26,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:01:26,837 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:01:26,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:01:26,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:01:26,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:01:26,838 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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b [2021-12-21 15:01:27,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:01:27,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:01:27,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:01:27,237 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:01:27,237 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:01:27,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2021-12-21 15:01:27,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0097373/36c53a945dcb4e9ba752f76337bdfaa9/FLAG828c183e3 [2021-12-21 15:01:27,844 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:01:27,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2021-12-21 15:01:27,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0097373/36c53a945dcb4e9ba752f76337bdfaa9/FLAG828c183e3 [2021-12-21 15:01:28,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0097373/36c53a945dcb4e9ba752f76337bdfaa9 [2021-12-21 15:01:28,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:01:28,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:01:28,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:28,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:01:28,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:01:28,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c156a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28, skipping insertion in model container [2021-12-21 15:01:28,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:01:28,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:01:28,560 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/mix010.oepc.i[945,958] [2021-12-21 15:01:28,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:28,733 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:01:28,745 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/mix010.oepc.i[945,958] [2021-12-21 15:01:28,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:28,817 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:01:28,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28 WrapperNode [2021-12-21 15:01:28,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:28,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:28,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:01:28,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:01:28,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,889 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2021-12-21 15:01:28,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:28,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:01:28,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:01:28,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:01:28,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:01:28,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:01:28,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:01:28,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:01:28,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (1/1) ... [2021-12-21 15:01:28,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:01:28,976 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) [2021-12-21 15:01:28,978 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 [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:01:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:01:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:01:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-21 15:01:29,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-21 15:01:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:01:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:01:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:01:29,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:01:29,041 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:01:29,168 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:01:29,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:01:29,667 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:01:29,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:01:29,959 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:01:29,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:29 BoogieIcfgContainer [2021-12-21 15:01:29,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:01:29,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:01:29,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:01:29,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:01:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:01:28" (1/3) ... [2021-12-21 15:01:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501c4440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:29, skipping insertion in model container [2021-12-21 15:01:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:28" (2/3) ... [2021-12-21 15:01:29,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501c4440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:29, skipping insertion in model container [2021-12-21 15:01:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:29" (3/3) ... [2021-12-21 15:01:29,968 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2021-12-21 15:01:29,972 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:01:29,972 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:01:29,972 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:01:29,972 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:01:30,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,015 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,015 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,015 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,015 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,016 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,017 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,017 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,022 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,027 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,027 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,028 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,028 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,028 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,028 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,028 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,029 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,036 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,037 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,038 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,057 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,058 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,062 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,063 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:01:30,107 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:01:30,113 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:01:30,114 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-21 15:01:30,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2021-12-21 15:01:30,168 INFO L129 PetriNetUnfolder]: 2/119 cut-off events. [2021-12-21 15:01:30,168 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:30,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-12-21 15:01:30,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2021-12-21 15:01:30,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2021-12-21 15:01:30,190 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-12-21 15:01:30,190 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:30,190 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:30,191 INFO L254 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] [2021-12-21 15:01:30,191 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash -594751337, now seen corresponding path program 1 times [2021-12-21 15:01:30,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489824206] [2021-12-21 15:01:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:30,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:30,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:30,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489824206] [2021-12-21 15:01:30,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489824206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:30,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:30,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:01:30,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263422739] [2021-12-21 15:01:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:30,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:01:30,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:01:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:01:30,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2021-12-21 15:01:30,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) [2021-12-21 15:01:30,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:30,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2021-12-21 15:01:30,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:30,866 INFO L129 PetriNetUnfolder]: 58/283 cut-off events. [2021-12-21 15:01:30,866 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-21 15:01:30,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 283 events. 58/283 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1157 event pairs, 10 based on Foata normal form. 23/291 useless extension candidates. Maximal degree in co-relation 356. Up to 79 conditions per place. [2021-12-21 15:01:30,870 INFO L132 encePairwiseOnDemand]: 117/122 looper letters, 14 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2021-12-21 15:01:30,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 289 flow [2021-12-21 15:01:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:01:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:01:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2021-12-21 15:01:30,880 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9426229508196722 [2021-12-21 15:01:30,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2021-12-21 15:01:30,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2021-12-21 15:01:30,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:30,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2021-12-21 15:01:30,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2021-12-21 15:01:30,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2021-12-21 15:01:30,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2021-12-21 15:01:30,892 INFO L186 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 345 transitions. [2021-12-21 15:01:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 289 flow [2021-12-21 15:01:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-21 15:01:30,897 INFO L242 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2021-12-21 15:01:30,898 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2021-12-21 15:01:30,901 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2021-12-21 15:01:30,901 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2021-12-21 15:01:30,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) [2021-12-21 15:01:30,902 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:30,902 INFO L254 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] [2021-12-21 15:01:30,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:01:30,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1907752176, now seen corresponding path program 1 times [2021-12-21 15:01:30,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:30,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595051429] [2021-12-21 15:01:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:30,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:31,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595051429] [2021-12-21 15:01:31,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595051429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:31,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:31,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:31,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142885071] [2021-12-21 15:01:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:31,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:31,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:31,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2021-12-21 15:01:31,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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) [2021-12-21 15:01:31,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:31,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2021-12-21 15:01:31,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:31,710 INFO L129 PetriNetUnfolder]: 1548/3917 cut-off events. [2021-12-21 15:01:31,711 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2021-12-21 15:01:31,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6462 conditions, 3917 events. 1548/3917 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 31853 event pairs, 252 based on Foata normal form. 0/3823 useless extension candidates. Maximal degree in co-relation 6402. Up to 1203 conditions per place. [2021-12-21 15:01:31,748 INFO L132 encePairwiseOnDemand]: 114/122 looper letters, 27 selfloop transitions, 4 changer transitions 66/176 dead transitions. [2021-12-21 15:01:31,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 176 transitions, 548 flow [2021-12-21 15:01:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1018 transitions. [2021-12-21 15:01:31,753 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8344262295081967 [2021-12-21 15:01:31,753 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1018 transitions. [2021-12-21 15:01:31,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1018 transitions. [2021-12-21 15:01:31,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:31,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1018 transitions. [2021-12-21 15:01:31,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 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) [2021-12-21 15:01:31,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,761 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,761 INFO L186 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 10 states and 1018 transitions. [2021-12-21 15:01:31,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 176 transitions, 548 flow [2021-12-21 15:01:31,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 176 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:01:31,766 INFO L242 Difference]: Finished difference. Result has 138 places, 103 transitions, 236 flow [2021-12-21 15:01:31,766 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2021-12-21 15:01:31,767 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 11 predicate places. [2021-12-21 15:01:31,767 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 236 flow [2021-12-21 15:01:31,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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) [2021-12-21 15:01:31,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:31,768 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:31,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:01:31,769 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2065347809, now seen corresponding path program 1 times [2021-12-21 15:01:31,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:31,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379509687] [2021-12-21 15:01:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:31,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:31,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379509687] [2021-12-21 15:01:31,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379509687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:31,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:31,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:31,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644033124] [2021-12-21 15:01:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:31,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:31,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:31,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2021-12-21 15:01:31,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2021-12-21 15:01:31,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:31,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2021-12-21 15:01:31,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:32,199 INFO L129 PetriNetUnfolder]: 459/1031 cut-off events. [2021-12-21 15:01:32,200 INFO L130 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2021-12-21 15:01:32,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 1031 events. 459/1031 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5688 event pairs, 155 based on Foata normal form. 27/1020 useless extension candidates. Maximal degree in co-relation 1981. Up to 374 conditions per place. [2021-12-21 15:01:32,205 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 21 selfloop transitions, 2 changer transitions 37/146 dead transitions. [2021-12-21 15:01:32,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 146 transitions, 462 flow [2021-12-21 15:01:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:01:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:01:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 962 transitions. [2021-12-21 15:01:32,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8761384335154827 [2021-12-21 15:01:32,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 962 transitions. [2021-12-21 15:01:32,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 962 transitions. [2021-12-21 15:01:32,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:32,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 962 transitions. [2021-12-21 15:01:32,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.88888888888889) internal successors, (962), 9 states have internal predecessors, (962), 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) [2021-12-21 15:01:32,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-12-21 15:01:32,213 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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) [2021-12-21 15:01:32,213 INFO L186 Difference]: Start difference. First operand has 138 places, 103 transitions, 236 flow. Second operand 9 states and 962 transitions. [2021-12-21 15:01:32,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 146 transitions, 462 flow [2021-12-21 15:01:32,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 146 transitions, 426 flow, removed 14 selfloop flow, removed 9 redundant places. [2021-12-21 15:01:32,219 INFO L242 Difference]: Finished difference. Result has 126 places, 103 transitions, 236 flow [2021-12-21 15:01:32,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=126, PETRI_TRANSITIONS=103} [2021-12-21 15:01:32,220 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2021-12-21 15:01:32,220 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 103 transitions, 236 flow [2021-12-21 15:01:32,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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) [2021-12-21 15:01:32,220 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:32,221 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:32,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:01:32,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 807585503, now seen corresponding path program 1 times [2021-12-21 15:01:32,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:32,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862141289] [2021-12-21 15:01:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:32,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:32,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:32,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862141289] [2021-12-21 15:01:32,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862141289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:32,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:32,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:32,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965316507] [2021-12-21 15:01:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:32,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:32,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:32,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-12-21 15:01:32,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 103 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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) [2021-12-21 15:01:32,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:32,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-12-21 15:01:32,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:32,662 INFO L129 PetriNetUnfolder]: 917/1963 cut-off events. [2021-12-21 15:01:32,662 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2021-12-21 15:01:32,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1963 events. 917/1963 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13313 event pairs, 67 based on Foata normal form. 0/1922 useless extension candidates. Maximal degree in co-relation 3624. Up to 481 conditions per place. [2021-12-21 15:01:32,671 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 31 selfloop transitions, 6 changer transitions 50/170 dead transitions. [2021-12-21 15:01:32,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 170 transitions, 548 flow [2021-12-21 15:01:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2021-12-21 15:01:32,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8762295081967213 [2021-12-21 15:01:32,674 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1069 transitions. [2021-12-21 15:01:32,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1069 transitions. [2021-12-21 15:01:32,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:32,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1069 transitions. [2021-12-21 15:01:32,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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) [2021-12-21 15:01:32,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,679 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,679 INFO L186 Difference]: Start difference. First operand has 126 places, 103 transitions, 236 flow. Second operand 10 states and 1069 transitions. [2021-12-21 15:01:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 170 transitions, 548 flow [2021-12-21 15:01:32,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 170 transitions, 532 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-12-21 15:01:32,684 INFO L242 Difference]: Finished difference. Result has 127 places, 105 transitions, 274 flow [2021-12-21 15:01:32,684 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2021-12-21 15:01:32,686 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2021-12-21 15:01:32,686 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 274 flow [2021-12-21 15:01:32,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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) [2021-12-21 15:01:32,687 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:32,688 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:32,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:01:32,688 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 8228587, now seen corresponding path program 1 times [2021-12-21 15:01:32,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:32,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050009501] [2021-12-21 15:01:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:32,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:32,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050009501] [2021-12-21 15:01:32,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050009501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:32,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:32,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:32,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318411680] [2021-12-21 15:01:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:32,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:32,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:32,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-12-21 15:01:32,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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) [2021-12-21 15:01:32,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:32,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-12-21 15:01:32,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,092 INFO L129 PetriNetUnfolder]: 316/849 cut-off events. [2021-12-21 15:01:33,092 INFO L130 PetriNetUnfolder]: For 681/683 co-relation queries the response was YES. [2021-12-21 15:01:33,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 849 events. 316/849 cut-off events. For 681/683 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4837 event pairs, 35 based on Foata normal form. 30/870 useless extension candidates. Maximal degree in co-relation 2042. Up to 182 conditions per place. [2021-12-21 15:01:33,097 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 37 selfloop transitions, 9 changer transitions 39/168 dead transitions. [2021-12-21 15:01:33,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 703 flow [2021-12-21 15:01:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1067 transitions. [2021-12-21 15:01:33,100 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8745901639344262 [2021-12-21 15:01:33,100 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1067 transitions. [2021-12-21 15:01:33,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1067 transitions. [2021-12-21 15:01:33,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1067 transitions. [2021-12-21 15:01:33,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.7) internal successors, (1067), 10 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,104 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,104 INFO L186 Difference]: Start difference. First operand has 127 places, 105 transitions, 274 flow. Second operand 10 states and 1067 transitions. [2021-12-21 15:01:33,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 703 flow [2021-12-21 15:01:33,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 168 transitions, 679 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:33,109 INFO L242 Difference]: Finished difference. Result has 131 places, 108 transitions, 342 flow [2021-12-21 15:01:33,109 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=131, PETRI_TRANSITIONS=108} [2021-12-21 15:01:33,110 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2021-12-21 15:01:33,110 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 108 transitions, 342 flow [2021-12-21 15:01:33,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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) [2021-12-21 15:01:33,110 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,111 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:01:33,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -259209701, now seen corresponding path program 1 times [2021-12-21 15:01:33,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33668705] [2021-12-21 15:01:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:33,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33668705] [2021-12-21 15:01:33,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33668705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:33,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:33,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:33,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797831521] [2021-12-21 15:01:33,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:33,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:33,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:33,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:33,278 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2021-12-21 15:01:33,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 108 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:33,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2021-12-21 15:01:33,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,566 INFO L129 PetriNetUnfolder]: 194/757 cut-off events. [2021-12-21 15:01:33,567 INFO L130 PetriNetUnfolder]: For 905/962 co-relation queries the response was YES. [2021-12-21 15:01:33,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 757 events. 194/757 cut-off events. For 905/962 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4381 event pairs, 39 based on Foata normal form. 20/761 useless extension candidates. Maximal degree in co-relation 1737. Up to 160 conditions per place. [2021-12-21 15:01:33,571 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 33 selfloop transitions, 2 changer transitions 20/143 dead transitions. [2021-12-21 15:01:33,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 143 transitions, 527 flow [2021-12-21 15:01:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:01:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:01:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2021-12-21 15:01:33,573 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.860655737704918 [2021-12-21 15:01:33,573 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2021-12-21 15:01:33,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2021-12-21 15:01:33,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2021-12-21 15:01:33,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 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) [2021-12-21 15:01:33,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-12-21 15:01:33,576 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-12-21 15:01:33,576 INFO L186 Difference]: Start difference. First operand has 131 places, 108 transitions, 342 flow. Second operand 7 states and 735 transitions. [2021-12-21 15:01:33,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 143 transitions, 527 flow [2021-12-21 15:01:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 143 transitions, 471 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-12-21 15:01:33,581 INFO L242 Difference]: Finished difference. Result has 129 places, 109 transitions, 305 flow [2021-12-21 15:01:33,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2021-12-21 15:01:33,581 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 2 predicate places. [2021-12-21 15:01:33,582 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 305 flow [2021-12-21 15:01:33,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,582 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:01:33,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1128785945, now seen corresponding path program 2 times [2021-12-21 15:01:33,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128964422] [2021-12-21 15:01:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:33,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128964422] [2021-12-21 15:01:33,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128964422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:33,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:33,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:01:33,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532033554] [2021-12-21 15:01:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:33,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:01:33,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:01:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:01:33,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-12-21 15:01:33,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 305 flow. Second operand 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) [2021-12-21 15:01:33,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:33,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-12-21 15:01:33,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,885 INFO L129 PetriNetUnfolder]: 196/642 cut-off events. [2021-12-21 15:01:33,886 INFO L130 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2021-12-21 15:01:33,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 642 events. 196/642 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3631 event pairs, 41 based on Foata normal form. 18/639 useless extension candidates. Maximal degree in co-relation 1422. Up to 108 conditions per place. [2021-12-21 15:01:33,889 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 26 selfloop transitions, 12 changer transitions 24/145 dead transitions. [2021-12-21 15:01:33,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 145 transitions, 566 flow [2021-12-21 15:01:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:01:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:01:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1141 transitions. [2021-12-21 15:01:33,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8502235469448585 [2021-12-21 15:01:33,902 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1141 transitions. [2021-12-21 15:01:33,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1141 transitions. [2021-12-21 15:01:33,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1141 transitions. [2021-12-21 15:01:33,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 103.72727272727273) internal successors, (1141), 11 states have internal predecessors, (1141), 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) [2021-12-21 15:01:33,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-12-21 15:01:33,906 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-12-21 15:01:33,906 INFO L186 Difference]: Start difference. First operand has 129 places, 109 transitions, 305 flow. Second operand 11 states and 1141 transitions. [2021-12-21 15:01:33,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 145 transitions, 566 flow [2021-12-21 15:01:33,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 145 transitions, 533 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-12-21 15:01:33,910 INFO L242 Difference]: Finished difference. Result has 136 places, 108 transitions, 324 flow [2021-12-21 15:01:33,910 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2021-12-21 15:01:33,910 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2021-12-21 15:01:33,911 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 324 flow [2021-12-21 15:01:33,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-21 15:01:33,911 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,911 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:01:33,912 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -544088344, now seen corresponding path program 1 times [2021-12-21 15:01:33,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884192019] [2021-12-21 15:01:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:34,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:34,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884192019] [2021-12-21 15:01:34,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884192019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:34,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:34,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:34,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629749956] [2021-12-21 15:01:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:34,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:34,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:34,011 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2021-12-21 15:01:34,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 108 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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) [2021-12-21 15:01:34,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:34,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2021-12-21 15:01:34,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:34,163 INFO L129 PetriNetUnfolder]: 101/493 cut-off events. [2021-12-21 15:01:34,163 INFO L130 PetriNetUnfolder]: For 245/249 co-relation queries the response was YES. [2021-12-21 15:01:34,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 493 events. 101/493 cut-off events. For 245/249 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2587 event pairs, 20 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 974. Up to 90 conditions per place. [2021-12-21 15:01:34,166 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 20 selfloop transitions, 1 changer transitions 14/124 dead transitions. [2021-12-21 15:01:34,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 432 flow [2021-12-21 15:01:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:01:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:01:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2021-12-21 15:01:34,167 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8454332552693209 [2021-12-21 15:01:34,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2021-12-21 15:01:34,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2021-12-21 15:01:34,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:34,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2021-12-21 15:01:34,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-12-21 15:01:34,170 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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) [2021-12-21 15:01:34,170 INFO L186 Difference]: Start difference. First operand has 136 places, 108 transitions, 324 flow. Second operand 7 states and 722 transitions. [2021-12-21 15:01:34,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 124 transitions, 432 flow [2021-12-21 15:01:34,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 124 transitions, 352 flow, removed 21 selfloop flow, removed 16 redundant places. [2021-12-21 15:01:34,174 INFO L242 Difference]: Finished difference. Result has 126 places, 108 transitions, 259 flow [2021-12-21 15:01:34,174 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=126, PETRI_TRANSITIONS=108} [2021-12-21 15:01:34,192 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2021-12-21 15:01:34,193 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 108 transitions, 259 flow [2021-12-21 15:01:34,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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) [2021-12-21 15:01:34,193 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:34,193 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:34,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:01:34,193 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 15537558, now seen corresponding path program 2 times [2021-12-21 15:01:34,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363129398] [2021-12-21 15:01:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:34,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:34,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:34,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363129398] [2021-12-21 15:01:34,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363129398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:34,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:34,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:01:34,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175896087] [2021-12-21 15:01:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:34,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:01:34,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:01:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:01:34,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2021-12-21 15:01:34,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 108 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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) [2021-12-21 15:01:34,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:34,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2021-12-21 15:01:34,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:34,593 INFO L129 PetriNetUnfolder]: 47/359 cut-off events. [2021-12-21 15:01:34,593 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-12-21 15:01:34,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 359 events. 47/359 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1577 event pairs, 7 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 563. Up to 50 conditions per place. [2021-12-21 15:01:34,595 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 26 selfloop transitions, 5 changer transitions 10/127 dead transitions. [2021-12-21 15:01:34,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 393 flow [2021-12-21 15:01:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2021-12-21 15:01:34,597 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2021-12-21 15:01:34,597 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2021-12-21 15:01:34,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2021-12-21 15:01:34,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:34,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2021-12-21 15:01:34,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 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) [2021-12-21 15:01:34,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,601 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,601 INFO L186 Difference]: Start difference. First operand has 126 places, 108 transitions, 259 flow. Second operand 10 states and 992 transitions. [2021-12-21 15:01:34,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 393 flow [2021-12-21 15:01:34,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 378 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:34,603 INFO L242 Difference]: Finished difference. Result has 132 places, 110 transitions, 281 flow [2021-12-21 15:01:34,603 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=281, PETRI_PLACES=132, PETRI_TRANSITIONS=110} [2021-12-21 15:01:34,608 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 5 predicate places. [2021-12-21 15:01:34,609 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 110 transitions, 281 flow [2021-12-21 15:01:34,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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) [2021-12-21 15:01:34,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:34,609 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:34,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:01:34,610 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash 62626422, now seen corresponding path program 3 times [2021-12-21 15:01:34,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:34,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384573779] [2021-12-21 15:01:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:34,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:34,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:34,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384573779] [2021-12-21 15:01:34,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384573779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:34,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:34,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:01:34,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410782678] [2021-12-21 15:01:34,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:34,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:01:34,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:01:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:01:34,834 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2021-12-21 15:01:34,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 110 transitions, 281 flow. Second operand has 11 states, 11 states have (on average 95.18181818181819) internal successors, (1047), 11 states have internal predecessors, (1047), 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) [2021-12-21 15:01:34,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:34,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2021-12-21 15:01:34,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:35,047 INFO L129 PetriNetUnfolder]: 37/314 cut-off events. [2021-12-21 15:01:35,048 INFO L130 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2021-12-21 15:01:35,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 314 events. 37/314 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1246 event pairs, 3 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 545. Up to 29 conditions per place. [2021-12-21 15:01:35,049 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 23 selfloop transitions, 6 changer transitions 11/124 dead transitions. [2021-12-21 15:01:35,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 407 flow [2021-12-21 15:01:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:01:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:01:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1063 transitions. [2021-12-21 15:01:35,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7921013412816692 [2021-12-21 15:01:35,052 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1063 transitions. [2021-12-21 15:01:35,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1063 transitions. [2021-12-21 15:01:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:35,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1063 transitions. [2021-12-21 15:01:35,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.63636363636364) internal successors, (1063), 11 states have internal predecessors, (1063), 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) [2021-12-21 15:01:35,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-12-21 15:01:35,056 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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) [2021-12-21 15:01:35,057 INFO L186 Difference]: Start difference. First operand has 132 places, 110 transitions, 281 flow. Second operand 11 states and 1063 transitions. [2021-12-21 15:01:35,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 124 transitions, 407 flow [2021-12-21 15:01:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 124 transitions, 388 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-12-21 15:01:35,059 INFO L242 Difference]: Finished difference. Result has 136 places, 110 transitions, 293 flow [2021-12-21 15:01:35,059 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=293, PETRI_PLACES=136, PETRI_TRANSITIONS=110} [2021-12-21 15:01:35,060 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2021-12-21 15:01:35,060 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 110 transitions, 293 flow [2021-12-21 15:01:35,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 95.18181818181819) internal successors, (1047), 11 states have internal predecessors, (1047), 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) [2021-12-21 15:01:35,061 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:35,061 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:35,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:01:35,061 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1070033226, now seen corresponding path program 4 times [2021-12-21 15:01:35,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:35,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614760521] [2021-12-21 15:01:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:35,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:35,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:01:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:35,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:01:35,157 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:01:35,158 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-21 15:01:35,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-21 15:01:35,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-21 15:01:35,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-21 15:01:35,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-21 15:01:35,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-21 15:01:35,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:01:35,163 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2021-12-21 15:01:35,166 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:01:35,166 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:01:35,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:01:35 BasicIcfg [2021-12-21 15:01:35,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:01:35,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:01:35,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:01:35,329 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:01:35,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:29" (3/4) ... [2021-12-21 15:01:35,331 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:01:35,412 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:01:35,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:01:35,413 INFO L158 Benchmark]: Toolchain (without parser) took 7089.86ms. Allocated memory was 96.5MB in the beginning and 272.6MB in the end (delta: 176.2MB). Free memory was 55.8MB in the beginning and 166.0MB in the end (delta: -110.2MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,413 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 73.9MB in the beginning and 73.9MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:01:35,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.86ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 55.6MB in the beginning and 87.8MB in the end (delta: -32.3MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.35ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 85.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,413 INFO L158 Benchmark]: Boogie Preprocessor took 32.28ms. Allocated memory is still 125.8MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,414 INFO L158 Benchmark]: RCFGBuilder took 1038.96ms. Allocated memory is still 125.8MB. Free memory was 83.1MB in the beginning and 86.0MB in the end (delta: -2.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,414 INFO L158 Benchmark]: TraceAbstraction took 5366.43ms. Allocated memory was 125.8MB in the beginning and 272.6MB in the end (delta: 146.8MB). Free memory was 85.3MB in the beginning and 209.0MB in the end (delta: -123.7MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,414 INFO L158 Benchmark]: Witness Printer took 82.93ms. Allocated memory is still 272.6MB. Free memory was 209.0MB in the beginning and 166.0MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,415 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.16ms. Allocated memory is still 96.5MB. Free memory was 73.9MB in the beginning and 73.9MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.86ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 55.6MB in the beginning and 87.8MB in the end (delta: -32.3MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.35ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 85.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.28ms. Allocated memory is still 125.8MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1038.96ms. Allocated memory is still 125.8MB. Free memory was 83.1MB in the beginning and 86.0MB in the end (delta: -2.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5366.43ms. Allocated memory was 125.8MB in the beginning and 272.6MB in the end (delta: 146.8MB). Free memory was 85.3MB in the beginning and 209.0MB in the end (delta: -123.7MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. * Witness Printer took 82.93ms. Allocated memory is still 272.6MB. Free memory was 209.0MB in the beginning and 166.0MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L723] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L724] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L725] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L726] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L727] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L733] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L734] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L735] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L736] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L737] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t257; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257, ((void *)0), P0, ((void *)0))=-2, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-1, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 918 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 94 mSDtfsCounter, 1268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=5, InterpolantAutomatonStates: 88, 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.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 841 ConstructedInterpolants, 0 QuantifiedInterpolants, 3731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2021-12-21 15:01:35,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE