./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/mix005_tso.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 c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:16:21,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:16:21,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:16:21,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:16:21,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:16:21,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:16:21,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:16:21,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:16:21,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:16:21,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:16:21,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:16:21,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:16:21,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:16:21,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:16:21,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:16:21,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:16:21,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:16:21,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:16:21,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:16:21,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:16:21,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:16:21,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:16:21,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:16:21,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:16:21,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:16:21,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:16:21,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:16:21,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:16:21,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:16:21,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:16:21,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:16:21,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:16:21,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:16:21,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:16:21,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:16:21,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:16:21,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:16:21,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:16:21,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:16:21,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:16:21,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:16:21,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:16:21,864 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:16:21,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:16:21,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:16:21,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:16:21,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:16:21,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:16:21,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:16:21,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:16:21,871 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:16:21,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:16:21,871 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:16:21,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:16:21,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:16:21,872 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:16:21,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:16:21,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:16:21,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:16:21,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:16:21,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:16:21,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:16:21,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:16:21,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:16:21,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:16:21,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:16:21,875 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:16:21,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:16:21,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:16:21,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:16:21,876 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2021-12-17 22:16:22,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:16:22,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:16:22,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:16:22,105 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:16:22,106 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:16:22,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2021-12-17 22:16:22,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff5036e/827bf20a03a4455d963d1fb73e0773fb/FLAGbb6cbd8ab [2021-12-17 22:16:22,627 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:16:22,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2021-12-17 22:16:22,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff5036e/827bf20a03a4455d963d1fb73e0773fb/FLAGbb6cbd8ab [2021-12-17 22:16:23,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff5036e/827bf20a03a4455d963d1fb73e0773fb [2021-12-17 22:16:23,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:16:23,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:16:23,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:16:23,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:16:23,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:16:23,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f21e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23, skipping insertion in model container [2021-12-17 22:16:23,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:16:23,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:16:23,332 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/mix005_tso.oepc.i[949,962] [2021-12-17 22:16:23,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:16:23,528 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:16:23,537 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/mix005_tso.oepc.i[949,962] [2021-12-17 22:16:23,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:16:23,630 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:16:23,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23 WrapperNode [2021-12-17 22:16:23,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:16:23,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:16:23,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:16:23,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:16:23,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,689 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2021-12-17 22:16:23,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:16:23,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:16:23,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:16:23,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:16:23,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:16:23,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:16:23,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:16:23,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:16:23,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (1/1) ... [2021-12-17 22:16:23,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:16:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:16:23,760 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-17 22:16:23,762 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-17 22:16:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:16:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:16:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:16:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:16:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:16:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-17 22:16:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-17 22:16:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-17 22:16:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-17 22:16:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-17 22:16:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-17 22:16:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-17 22:16:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-17 22:16:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:16:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:16:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:16:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:16:23,787 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:16:23,890 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:16:23,892 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:16:24,363 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:16:24,608 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:16:24,608 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 22:16:24,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:16:24 BoogieIcfgContainer [2021-12-17 22:16:24,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:16:24,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:16:24,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:16:24,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:16:24,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:16:23" (1/3) ... [2021-12-17 22:16:24,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:16:24, skipping insertion in model container [2021-12-17 22:16:24,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:16:23" (2/3) ... [2021-12-17 22:16:24,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:16:24, skipping insertion in model container [2021-12-17 22:16:24,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:16:24" (3/3) ... [2021-12-17 22:16:24,619 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2021-12-17 22:16:24,623 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:16:24,624 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:16:24,624 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 22:16:24,624 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:16:24,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,657 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,658 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,671 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,671 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,671 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,671 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,675 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,675 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,675 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,676 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,677 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,678 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,679 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,683 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,683 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,683 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,684 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,685 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,685 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:16:24,688 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:16:24,718 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:16:24,723 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-17 22:16:24,727 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-17 22:16:24,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2021-12-17 22:16:24,772 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2021-12-17 22:16:24,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:16:24,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2021-12-17 22:16:24,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2021-12-17 22:16:24,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2021-12-17 22:16:24,787 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2021-12-17 22:16:24,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:16:24,788 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:24,788 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] [2021-12-17 22:16:24,789 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1996518298, now seen corresponding path program 1 times [2021-12-17 22:16:24,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:24,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900953657] [2021-12-17 22:16:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:24,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:25,056 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-17 22:16:25,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:25,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900953657] [2021-12-17 22:16:25,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900953657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:25,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:25,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:16:25,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639876806] [2021-12-17 22:16:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:25,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:16:25,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:16:25,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:16:25,098 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2021-12-17 22:16:25,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:16:25,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:25,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2021-12-17 22:16:25,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:25,357 INFO L129 PetriNetUnfolder]: 161/1036 cut-off events. [2021-12-17 22:16:25,357 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-17 22:16:25,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1036 events. 161/1036 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7039 event pairs, 103 based on Foata normal form. 35/1013 useless extension candidates. Maximal degree in co-relation 1279. Up to 187 conditions per place. [2021-12-17 22:16:25,370 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 17 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2021-12-17 22:16:25,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 334 flow [2021-12-17 22:16:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:16:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:16:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2021-12-17 22:16:25,387 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2021-12-17 22:16:25,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2021-12-17 22:16:25,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2021-12-17 22:16:25,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:25,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2021-12-17 22:16:25,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-17 22:16:25,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-17 22:16:25,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-17 22:16:25,415 INFO L186 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 396 transitions. [2021-12-17 22:16:25,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 334 flow [2021-12-17 22:16:25,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:16:25,423 INFO L242 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2021-12-17 22:16:25,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2021-12-17 22:16:25,431 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2021-12-17 22:16:25,435 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2021-12-17 22:16:25,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:16:25,435 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:25,436 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] [2021-12-17 22:16:25,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:16:25,436 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -583916909, now seen corresponding path program 1 times [2021-12-17 22:16:25,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104108776] [2021-12-17 22:16:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:25,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:25,692 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-17 22:16:25,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104108776] [2021-12-17 22:16:25,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104108776] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:25,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:25,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:16:25,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823921555] [2021-12-17 22:16:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:25,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:16:25,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:16:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:16:25,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2021-12-17 22:16:25,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-17 22:16:25,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:25,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2021-12-17 22:16:25,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:26,214 INFO L129 PetriNetUnfolder]: 869/2454 cut-off events. [2021-12-17 22:16:26,215 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2021-12-17 22:16:26,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2454 events. 869/2454 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19578 event pairs, 129 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 3867. Up to 609 conditions per place. [2021-12-17 22:16:26,229 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 21 selfloop transitions, 2 changer transitions 53/176 dead transitions. [2021-12-17 22:16:26,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 176 transitions, 504 flow [2021-12-17 22:16:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:16:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:16:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1118 transitions. [2021-12-17 22:16:26,232 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8873015873015873 [2021-12-17 22:16:26,232 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1118 transitions. [2021-12-17 22:16:26,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1118 transitions. [2021-12-17 22:16:26,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:26,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1118 transitions. [2021-12-17 22:16:26,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.22222222222223) internal successors, (1118), 9 states have internal predecessors, (1118), 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-17 22:16:26,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-17 22:16:26,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-17 22:16:26,240 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1118 transitions. [2021-12-17 22:16:26,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 176 transitions, 504 flow [2021-12-17 22:16:26,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:16:26,243 INFO L242 Difference]: Finished difference. Result has 156 places, 118 transitions, 264 flow [2021-12-17 22:16:26,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=156, PETRI_TRANSITIONS=118} [2021-12-17 22:16:26,244 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2021-12-17 22:16:26,244 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 118 transitions, 264 flow [2021-12-17 22:16:26,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-17 22:16:26,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:26,245 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] [2021-12-17 22:16:26,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:16:26,245 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1362219406, now seen corresponding path program 1 times [2021-12-17 22:16:26,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261671915] [2021-12-17 22:16:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:26,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:26,370 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-17 22:16:26,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:26,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261671915] [2021-12-17 22:16:26,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261671915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:26,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:26,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:16:26,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091859745] [2021-12-17 22:16:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:26,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:16:26,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:26,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:16:26,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:16:26,375 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2021-12-17 22:16:26,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 118 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-17 22:16:26,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:26,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2021-12-17 22:16:26,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:26,774 INFO L129 PetriNetUnfolder]: 746/1607 cut-off events. [2021-12-17 22:16:26,774 INFO L130 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2021-12-17 22:16:26,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1607 events. 746/1607 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10020 event pairs, 200 based on Foata normal form. 36/1589 useless extension candidates. Maximal degree in co-relation 3057. Up to 571 conditions per place. [2021-12-17 22:16:26,782 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 22 selfloop transitions, 2 changer transitions 37/161 dead transitions. [2021-12-17 22:16:26,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 492 flow [2021-12-17 22:16:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:16:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:16:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1116 transitions. [2021-12-17 22:16:26,785 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2021-12-17 22:16:26,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1116 transitions. [2021-12-17 22:16:26,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1116 transitions. [2021-12-17 22:16:26,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:26,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1116 transitions. [2021-12-17 22:16:26,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 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-17 22:16:26,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-17 22:16:26,790 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-17 22:16:26,790 INFO L186 Difference]: Start difference. First operand has 156 places, 118 transitions, 264 flow. Second operand 9 states and 1116 transitions. [2021-12-17 22:16:26,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 492 flow [2021-12-17 22:16:26,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 460 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-17 22:16:26,801 INFO L242 Difference]: Finished difference. Result has 143 places, 118 transitions, 268 flow [2021-12-17 22:16:26,802 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2021-12-17 22:16:26,803 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2021-12-17 22:16:26,803 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 268 flow [2021-12-17 22:16:26,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-17 22:16:26,804 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:26,804 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] [2021-12-17 22:16:26,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:16:26,805 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:26,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1294539535, now seen corresponding path program 1 times [2021-12-17 22:16:26,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:26,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179651213] [2021-12-17 22:16:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:26,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:27,044 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-17 22:16:27,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:27,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179651213] [2021-12-17 22:16:27,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179651213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:27,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:27,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:16:27,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51340086] [2021-12-17 22:16:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:27,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:16:27,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:16:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:16:27,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-17 22:16:27,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 268 flow. Second operand has 11 states, 11 states have (on average 114.45454545454545) internal successors, (1259), 11 states have internal predecessors, (1259), 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-17 22:16:27,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:27,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-17 22:16:27,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:27,557 INFO L129 PetriNetUnfolder]: 895/1888 cut-off events. [2021-12-17 22:16:27,557 INFO L130 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2021-12-17 22:16:27,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1888 events. 895/1888 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11473 event pairs, 411 based on Foata normal form. 39/1877 useless extension candidates. Maximal degree in co-relation 3661. Up to 802 conditions per place. [2021-12-17 22:16:27,569 INFO L132 encePairwiseOnDemand]: 125/140 looper letters, 25 selfloop transitions, 13 changer transitions 52/186 dead transitions. [2021-12-17 22:16:27,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 626 flow [2021-12-17 22:16:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:16:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:16:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1901 transitions. [2021-12-17 22:16:27,573 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8486607142857143 [2021-12-17 22:16:27,573 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1901 transitions. [2021-12-17 22:16:27,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1901 transitions. [2021-12-17 22:16:27,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:27,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1901 transitions. [2021-12-17 22:16:27,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.8125) internal successors, (1901), 16 states have internal predecessors, (1901), 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-17 22:16:27,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:27,580 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:27,581 INFO L186 Difference]: Start difference. First operand has 143 places, 118 transitions, 268 flow. Second operand 16 states and 1901 transitions. [2021-12-17 22:16:27,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 626 flow [2021-12-17 22:16:27,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 186 transitions, 586 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-12-17 22:16:27,617 INFO L242 Difference]: Finished difference. Result has 155 places, 126 transitions, 368 flow [2021-12-17 22:16:27,617 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=368, PETRI_PLACES=155, PETRI_TRANSITIONS=126} [2021-12-17 22:16:27,617 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2021-12-17 22:16:27,617 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 126 transitions, 368 flow [2021-12-17 22:16:27,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 114.45454545454545) internal successors, (1259), 11 states have internal predecessors, (1259), 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-17 22:16:27,618 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:27,618 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] [2021-12-17 22:16:27,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:16:27,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1036438355, now seen corresponding path program 1 times [2021-12-17 22:16:27,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:27,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685638849] [2021-12-17 22:16:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:27,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:27,827 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-17 22:16:27,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:27,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685638849] [2021-12-17 22:16:27,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685638849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:27,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:27,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:16:27,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677803373] [2021-12-17 22:16:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:27,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:16:27,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:16:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:16:27,831 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-17 22:16:27,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 126 transitions, 368 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-17 22:16:27,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:27,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-17 22:16:27,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:28,247 INFO L129 PetriNetUnfolder]: 764/1560 cut-off events. [2021-12-17 22:16:28,247 INFO L130 PetriNetUnfolder]: For 4845/5117 co-relation queries the response was YES. [2021-12-17 22:16:28,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5818 conditions, 1560 events. 764/1560 cut-off events. For 4845/5117 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9120 event pairs, 172 based on Foata normal form. 36/1563 useless extension candidates. Maximal degree in co-relation 5739. Up to 777 conditions per place. [2021-12-17 22:16:28,261 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 26 selfloop transitions, 14 changer transitions 35/172 dead transitions. [2021-12-17 22:16:28,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 172 transitions, 852 flow [2021-12-17 22:16:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:16:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:16:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1554 transitions. [2021-12-17 22:16:28,265 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8538461538461538 [2021-12-17 22:16:28,265 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1554 transitions. [2021-12-17 22:16:28,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1554 transitions. [2021-12-17 22:16:28,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:28,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1554 transitions. [2021-12-17 22:16:28,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.53846153846153) internal successors, (1554), 13 states have internal predecessors, (1554), 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-17 22:16:28,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-17 22:16:28,272 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-17 22:16:28,272 INFO L186 Difference]: Start difference. First operand has 155 places, 126 transitions, 368 flow. Second operand 13 states and 1554 transitions. [2021-12-17 22:16:28,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 172 transitions, 852 flow [2021-12-17 22:16:28,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 172 transitions, 832 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-12-17 22:16:28,279 INFO L242 Difference]: Finished difference. Result has 159 places, 129 transitions, 464 flow [2021-12-17 22:16:28,280 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=464, PETRI_PLACES=159, PETRI_TRANSITIONS=129} [2021-12-17 22:16:28,280 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places. [2021-12-17 22:16:28,280 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 129 transitions, 464 flow [2021-12-17 22:16:28,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-17 22:16:28,281 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:28,281 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-17 22:16:28,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:16:28,282 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:28,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash -795527619, now seen corresponding path program 1 times [2021-12-17 22:16:28,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468565959] [2021-12-17 22:16:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:28,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:28,410 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-17 22:16:28,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468565959] [2021-12-17 22:16:28,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468565959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:28,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:28,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:16:28,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859274202] [2021-12-17 22:16:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:28,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:16:28,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:16:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:16:28,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-12-17 22:16:28,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 129 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 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-17 22:16:28,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:28,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-12-17 22:16:28,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:29,054 INFO L129 PetriNetUnfolder]: 904/1956 cut-off events. [2021-12-17 22:16:29,054 INFO L130 PetriNetUnfolder]: For 14603/14849 co-relation queries the response was YES. [2021-12-17 22:16:29,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 1956 events. 904/1956 cut-off events. For 14603/14849 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11921 event pairs, 213 based on Foata normal form. 37/1943 useless extension candidates. Maximal degree in co-relation 9468. Up to 800 conditions per place. [2021-12-17 22:16:29,080 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 34 selfloop transitions, 10 changer transitions 37/179 dead transitions. [2021-12-17 22:16:29,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 179 transitions, 1192 flow [2021-12-17 22:16:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:16:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:16:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1337 transitions. [2021-12-17 22:16:29,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8681818181818182 [2021-12-17 22:16:29,083 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1337 transitions. [2021-12-17 22:16:29,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1337 transitions. [2021-12-17 22:16:29,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:29,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1337 transitions. [2021-12-17 22:16:29,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.54545454545455) internal successors, (1337), 11 states have internal predecessors, (1337), 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-17 22:16:29,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-17 22:16:29,089 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-17 22:16:29,089 INFO L186 Difference]: Start difference. First operand has 159 places, 129 transitions, 464 flow. Second operand 11 states and 1337 transitions. [2021-12-17 22:16:29,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 179 transitions, 1192 flow [2021-12-17 22:16:29,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 179 transitions, 1135 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-12-17 22:16:29,097 INFO L242 Difference]: Finished difference. Result has 162 places, 133 transitions, 551 flow [2021-12-17 22:16:29,097 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=551, PETRI_PLACES=162, PETRI_TRANSITIONS=133} [2021-12-17 22:16:29,097 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 15 predicate places. [2021-12-17 22:16:29,098 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 133 transitions, 551 flow [2021-12-17 22:16:29,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 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-17 22:16:29,098 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:29,098 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, 1] [2021-12-17 22:16:29,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:16:29,099 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -465350909, now seen corresponding path program 1 times [2021-12-17 22:16:29,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:29,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712159730] [2021-12-17 22:16:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:29,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:29,339 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-17 22:16:29,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:29,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712159730] [2021-12-17 22:16:29,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712159730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:29,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:29,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-17 22:16:29,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784490701] [2021-12-17 22:16:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:29,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 22:16:29,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 22:16:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-17 22:16:29,344 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2021-12-17 22:16:29,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 133 transitions, 551 flow. Second operand has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 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-17 22:16:29,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:29,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2021-12-17 22:16:29,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:30,072 INFO L129 PetriNetUnfolder]: 777/1848 cut-off events. [2021-12-17 22:16:30,073 INFO L130 PetriNetUnfolder]: For 27749/28257 co-relation queries the response was YES. [2021-12-17 22:16:30,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11575 conditions, 1848 events. 777/1848 cut-off events. For 27749/28257 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12136 event pairs, 28 based on Foata normal form. 39/1856 useless extension candidates. Maximal degree in co-relation 11486. Up to 690 conditions per place. [2021-12-17 22:16:30,095 INFO L132 encePairwiseOnDemand]: 126/140 looper letters, 47 selfloop transitions, 22 changer transitions 50/214 dead transitions. [2021-12-17 22:16:30,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 214 transitions, 2140 flow [2021-12-17 22:16:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 22:16:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-17 22:16:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2460 transitions. [2021-12-17 22:16:30,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2021-12-17 22:16:30,099 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2460 transitions. [2021-12-17 22:16:30,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2460 transitions. [2021-12-17 22:16:30,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:30,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2460 transitions. [2021-12-17 22:16:30,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 117.14285714285714) internal successors, (2460), 21 states have internal predecessors, (2460), 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-17 22:16:30,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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-17 22:16:30,108 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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-17 22:16:30,109 INFO L186 Difference]: Start difference. First operand has 162 places, 133 transitions, 551 flow. Second operand 21 states and 2460 transitions. [2021-12-17 22:16:30,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 214 transitions, 2140 flow [2021-12-17 22:16:30,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 214 transitions, 1777 flow, removed 174 selfloop flow, removed 9 redundant places. [2021-12-17 22:16:30,121 INFO L242 Difference]: Finished difference. Result has 181 places, 141 transitions, 747 flow [2021-12-17 22:16:30,122 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=747, PETRI_PLACES=181, PETRI_TRANSITIONS=141} [2021-12-17 22:16:30,122 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 34 predicate places. [2021-12-17 22:16:30,122 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 141 transitions, 747 flow [2021-12-17 22:16:30,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 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-17 22:16:30,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:30,123 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, 1] [2021-12-17 22:16:30,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:16:30,124 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1074296648, now seen corresponding path program 1 times [2021-12-17 22:16:30,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740854102] [2021-12-17 22:16:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:30,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:30,199 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-17 22:16:30,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740854102] [2021-12-17 22:16:30,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740854102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:30,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:30,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:16:30,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688694161] [2021-12-17 22:16:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:30,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:16:30,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:16:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:16:30,202 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-17 22:16:30,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 141 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-17 22:16:30,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:30,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-17 22:16:30,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:32,172 INFO L129 PetriNetUnfolder]: 7545/12890 cut-off events. [2021-12-17 22:16:32,172 INFO L130 PetriNetUnfolder]: For 281495/283776 co-relation queries the response was YES. [2021-12-17 22:16:32,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71752 conditions, 12890 events. 7545/12890 cut-off events. For 281495/283776 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 99823 event pairs, 283 based on Foata normal form. 524/13146 useless extension candidates. Maximal degree in co-relation 71657. Up to 4707 conditions per place. [2021-12-17 22:16:32,297 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 116 selfloop transitions, 16 changer transitions 98/328 dead transitions. [2021-12-17 22:16:32,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 328 transitions, 3820 flow [2021-12-17 22:16:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:16:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:16:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2021-12-17 22:16:32,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-12-17 22:16:32,300 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2021-12-17 22:16:32,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2021-12-17 22:16:32,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:32,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2021-12-17 22:16:32,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 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-17 22:16:32,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-17 22:16:32,305 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-17 22:16:32,305 INFO L186 Difference]: Start difference. First operand has 181 places, 141 transitions, 747 flow. Second operand 10 states and 1230 transitions. [2021-12-17 22:16:32,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 328 transitions, 3820 flow [2021-12-17 22:16:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 328 transitions, 3117 flow, removed 348 selfloop flow, removed 16 redundant places. [2021-12-17 22:16:32,395 INFO L242 Difference]: Finished difference. Result has 168 places, 155 transitions, 753 flow [2021-12-17 22:16:32,395 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=753, PETRI_PLACES=168, PETRI_TRANSITIONS=155} [2021-12-17 22:16:32,396 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2021-12-17 22:16:32,396 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 155 transitions, 753 flow [2021-12-17 22:16:32,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-17 22:16:32,396 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:32,396 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, 1, 1] [2021-12-17 22:16:32,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:16:32,397 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1415937377, now seen corresponding path program 1 times [2021-12-17 22:16:32,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:32,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836704535] [2021-12-17 22:16:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:32,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:32,494 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-17 22:16:32,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:32,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836704535] [2021-12-17 22:16:32,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836704535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:32,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:32,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:16:32,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113659925] [2021-12-17 22:16:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:32,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:16:32,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:16:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:16:32,498 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-17 22:16:32,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 155 transitions, 753 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:16:32,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:32,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-17 22:16:32,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:34,410 INFO L129 PetriNetUnfolder]: 6805/12388 cut-off events. [2021-12-17 22:16:34,410 INFO L130 PetriNetUnfolder]: For 151422/153574 co-relation queries the response was YES. [2021-12-17 22:16:34,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 12388 events. 6805/12388 cut-off events. For 151422/153574 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 104333 event pairs, 205 based on Foata normal form. 711/13014 useless extension candidates. Maximal degree in co-relation 64473. Up to 3434 conditions per place. [2021-12-17 22:16:34,502 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 134 selfloop transitions, 30 changer transitions 128/390 dead transitions. [2021-12-17 22:16:34,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 390 transitions, 4235 flow [2021-12-17 22:16:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:16:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:16:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1599 transitions. [2021-12-17 22:16:34,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-12-17 22:16:34,506 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1599 transitions. [2021-12-17 22:16:34,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1599 transitions. [2021-12-17 22:16:34,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:34,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1599 transitions. [2021-12-17 22:16:34,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 123.0) internal successors, (1599), 13 states have internal predecessors, (1599), 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-17 22:16:34,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-17 22:16:34,514 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-17 22:16:34,514 INFO L186 Difference]: Start difference. First operand has 168 places, 155 transitions, 753 flow. Second operand 13 states and 1599 transitions. [2021-12-17 22:16:34,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 390 transitions, 4235 flow [2021-12-17 22:16:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 390 transitions, 4233 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 22:16:34,595 INFO L242 Difference]: Finished difference. Result has 185 places, 171 transitions, 986 flow [2021-12-17 22:16:34,596 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=986, PETRI_PLACES=185, PETRI_TRANSITIONS=171} [2021-12-17 22:16:34,596 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 38 predicate places. [2021-12-17 22:16:34,596 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 171 transitions, 986 flow [2021-12-17 22:16:34,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:16:34,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:34,597 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, 1, 1, 1, 1, 1] [2021-12-17 22:16:34,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:16:34,597 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1927368908, now seen corresponding path program 1 times [2021-12-17 22:16:34,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:34,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980039573] [2021-12-17 22:16:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:34,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:34,885 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-17 22:16:34,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:34,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980039573] [2021-12-17 22:16:34,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980039573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:34,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:34,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-17 22:16:34,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798410374] [2021-12-17 22:16:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:34,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 22:16:34,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 22:16:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-12-17 22:16:34,887 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 140 [2021-12-17 22:16:34,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 171 transitions, 986 flow. Second operand has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 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-17 22:16:34,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:34,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 140 [2021-12-17 22:16:34,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:35,956 INFO L129 PetriNetUnfolder]: 1319/4756 cut-off events. [2021-12-17 22:16:35,956 INFO L130 PetriNetUnfolder]: For 29381/34214 co-relation queries the response was YES. [2021-12-17 22:16:35,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20096 conditions, 4756 events. 1319/4756 cut-off events. For 29381/34214 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 50451 event pairs, 190 based on Foata normal form. 51/4573 useless extension candidates. Maximal degree in co-relation 19994. Up to 990 conditions per place. [2021-12-17 22:16:36,013 INFO L132 encePairwiseOnDemand]: 124/140 looper letters, 75 selfloop transitions, 44 changer transitions 0/245 dead transitions. [2021-12-17 22:16:36,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 2346 flow [2021-12-17 22:16:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 22:16:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-17 22:16:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2204 transitions. [2021-12-17 22:16:36,018 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-12-17 22:16:36,018 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2204 transitions. [2021-12-17 22:16:36,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2204 transitions. [2021-12-17 22:16:36,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:36,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2204 transitions. [2021-12-17 22:16:36,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 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-17 22:16:36,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-17 22:16:36,041 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-17 22:16:36,041 INFO L186 Difference]: Start difference. First operand has 185 places, 171 transitions, 986 flow. Second operand 19 states and 2204 transitions. [2021-12-17 22:16:36,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 2346 flow [2021-12-17 22:16:36,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 245 transitions, 2271 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-12-17 22:16:36,139 INFO L242 Difference]: Finished difference. Result has 205 places, 205 transitions, 1650 flow [2021-12-17 22:16:36,140 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1650, PETRI_PLACES=205, PETRI_TRANSITIONS=205} [2021-12-17 22:16:36,141 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 58 predicate places. [2021-12-17 22:16:36,141 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 1650 flow [2021-12-17 22:16:36,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 112.4) internal successors, (1686), 15 states have internal predecessors, (1686), 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-17 22:16:36,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:36,142 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, 1, 1, 1, 1, 1] [2021-12-17 22:16:36,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:16:36,142 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash 677321237, now seen corresponding path program 1 times [2021-12-17 22:16:36,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:36,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626758052] [2021-12-17 22:16:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:36,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:36,242 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-17 22:16:36,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626758052] [2021-12-17 22:16:36,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626758052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:36,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:36,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:16:36,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803959161] [2021-12-17 22:16:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:36,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:16:36,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:16:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:16:36,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-17 22:16:36,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 1650 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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-17 22:16:36,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:36,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-17 22:16:36,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:38,512 INFO L129 PetriNetUnfolder]: 7031/13278 cut-off events. [2021-12-17 22:16:38,513 INFO L130 PetriNetUnfolder]: For 307409/310350 co-relation queries the response was YES. [2021-12-17 22:16:38,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85448 conditions, 13278 events. 7031/13278 cut-off events. For 307409/310350 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 119092 event pairs, 191 based on Foata normal form. 1088/14266 useless extension candidates. Maximal degree in co-relation 85341. Up to 4312 conditions per place. [2021-12-17 22:16:38,651 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 147 selfloop transitions, 19 changer transitions 282/545 dead transitions. [2021-12-17 22:16:38,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 545 transitions, 8292 flow [2021-12-17 22:16:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:16:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:16:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1965 transitions. [2021-12-17 22:16:38,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8772321428571429 [2021-12-17 22:16:38,654 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1965 transitions. [2021-12-17 22:16:38,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1965 transitions. [2021-12-17 22:16:38,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:38,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1965 transitions. [2021-12-17 22:16:38,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 122.8125) internal successors, (1965), 16 states have internal predecessors, (1965), 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-17 22:16:38,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:38,660 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:38,660 INFO L186 Difference]: Start difference. First operand has 205 places, 205 transitions, 1650 flow. Second operand 16 states and 1965 transitions. [2021-12-17 22:16:38,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 545 transitions, 8292 flow [2021-12-17 22:16:39,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 545 transitions, 6966 flow, removed 631 selfloop flow, removed 11 redundant places. [2021-12-17 22:16:39,120 INFO L242 Difference]: Finished difference. Result has 215 places, 167 transitions, 1086 flow [2021-12-17 22:16:39,120 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1086, PETRI_PLACES=215, PETRI_TRANSITIONS=167} [2021-12-17 22:16:39,120 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 68 predicate places. [2021-12-17 22:16:39,120 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 167 transitions, 1086 flow [2021-12-17 22:16:39,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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-17 22:16:39,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:39,121 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:39,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:16:39,121 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1368630499, now seen corresponding path program 1 times [2021-12-17 22:16:39,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408338616] [2021-12-17 22:16:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:39,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:39,203 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-17 22:16:39,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:39,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408338616] [2021-12-17 22:16:39,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408338616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:39,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:39,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:16:39,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637173540] [2021-12-17 22:16:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:39,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:16:39,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:16:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:16:39,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-17 22:16:39,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 167 transitions, 1086 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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-17 22:16:39,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:39,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-17 22:16:39,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:40,042 INFO L129 PetriNetUnfolder]: 1207/4977 cut-off events. [2021-12-17 22:16:40,042 INFO L130 PetriNetUnfolder]: For 39206/42104 co-relation queries the response was YES. [2021-12-17 22:16:40,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19824 conditions, 4977 events. 1207/4977 cut-off events. For 39206/42104 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 56854 event pairs, 90 based on Foata normal form. 157/4761 useless extension candidates. Maximal degree in co-relation 19718. Up to 906 conditions per place. [2021-12-17 22:16:40,109 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 107 selfloop transitions, 2 changer transitions 20/248 dead transitions. [2021-12-17 22:16:40,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 248 transitions, 2507 flow [2021-12-17 22:16:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:16:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:16:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2021-12-17 22:16:40,111 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8704081632653061 [2021-12-17 22:16:40,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2021-12-17 22:16:40,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2021-12-17 22:16:40,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:40,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2021-12-17 22:16:40,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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-17 22:16:40,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-17 22:16:40,114 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-17 22:16:40,114 INFO L186 Difference]: Start difference. First operand has 215 places, 167 transitions, 1086 flow. Second operand 7 states and 853 transitions. [2021-12-17 22:16:40,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 248 transitions, 2507 flow [2021-12-17 22:16:40,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 248 transitions, 2248 flow, removed 113 selfloop flow, removed 18 redundant places. [2021-12-17 22:16:40,302 INFO L242 Difference]: Finished difference. Result has 189 places, 168 transitions, 974 flow [2021-12-17 22:16:40,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=974, PETRI_PLACES=189, PETRI_TRANSITIONS=168} [2021-12-17 22:16:40,303 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 42 predicate places. [2021-12-17 22:16:40,303 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 168 transitions, 974 flow [2021-12-17 22:16:40,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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-17 22:16:40,303 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:40,303 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:40,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:16:40,304 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash 716744345, now seen corresponding path program 2 times [2021-12-17 22:16:40,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:40,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41089485] [2021-12-17 22:16:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:40,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:40,396 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-17 22:16:40,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:40,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41089485] [2021-12-17 22:16:40,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41089485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:40,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:40,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:16:40,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242696067] [2021-12-17 22:16:40,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:40,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:16:40,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:16:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:16:40,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-17 22:16:40,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 168 transitions, 974 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-17 22:16:40,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:40,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-17 22:16:40,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:42,252 INFO L129 PetriNetUnfolder]: 5624/11976 cut-off events. [2021-12-17 22:16:42,252 INFO L130 PetriNetUnfolder]: For 162200/169513 co-relation queries the response was YES. [2021-12-17 22:16:42,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63238 conditions, 11976 events. 5624/11976 cut-off events. For 162200/169513 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 118721 event pairs, 304 based on Foata normal form. 772/12499 useless extension candidates. Maximal degree in co-relation 63198. Up to 3937 conditions per place. [2021-12-17 22:16:42,367 INFO L132 encePairwiseOnDemand]: 130/140 looper letters, 128 selfloop transitions, 23 changer transitions 141/390 dead transitions. [2021-12-17 22:16:42,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 390 transitions, 4478 flow [2021-12-17 22:16:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:16:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:16:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1918 transitions. [2021-12-17 22:16:42,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.85625 [2021-12-17 22:16:42,370 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1918 transitions. [2021-12-17 22:16:42,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1918 transitions. [2021-12-17 22:16:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:42,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1918 transitions. [2021-12-17 22:16:42,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.875) internal successors, (1918), 16 states have internal predecessors, (1918), 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-17 22:16:42,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:42,374 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-17 22:16:42,374 INFO L186 Difference]: Start difference. First operand has 189 places, 168 transitions, 974 flow. Second operand 16 states and 1918 transitions. [2021-12-17 22:16:42,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 390 transitions, 4478 flow [2021-12-17 22:16:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 390 transitions, 3677 flow, removed 357 selfloop flow, removed 7 redundant places. [2021-12-17 22:16:42,782 INFO L242 Difference]: Finished difference. Result has 200 places, 166 transitions, 870 flow [2021-12-17 22:16:42,782 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=870, PETRI_PLACES=200, PETRI_TRANSITIONS=166} [2021-12-17 22:16:42,783 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 53 predicate places. [2021-12-17 22:16:42,783 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 166 transitions, 870 flow [2021-12-17 22:16:42,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-17 22:16:42,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:42,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:42,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 22:16:42,784 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 445941000, now seen corresponding path program 1 times [2021-12-17 22:16:42,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974422503] [2021-12-17 22:16:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:42,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:43,032 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-17 22:16:43,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:43,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974422503] [2021-12-17 22:16:43,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974422503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:43,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:43,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-17 22:16:43,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739526984] [2021-12-17 22:16:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:43,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 22:16:43,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 22:16:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-12-17 22:16:43,034 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2021-12-17 22:16:43,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 166 transitions, 870 flow. Second operand has 13 states, 13 states have (on average 111.92307692307692) internal successors, (1455), 13 states have internal predecessors, (1455), 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-17 22:16:43,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:43,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2021-12-17 22:16:43,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:44,420 INFO L129 PetriNetUnfolder]: 1737/8140 cut-off events. [2021-12-17 22:16:44,420 INFO L130 PetriNetUnfolder]: For 26433/28942 co-relation queries the response was YES. [2021-12-17 22:16:44,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26661 conditions, 8140 events. 1737/8140 cut-off events. For 26433/28942 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 109224 event pairs, 63 based on Foata normal form. 69/7573 useless extension candidates. Maximal degree in co-relation 26558. Up to 1457 conditions per place. [2021-12-17 22:16:44,498 INFO L132 encePairwiseOnDemand]: 125/140 looper letters, 77 selfloop transitions, 38 changer transitions 5/232 dead transitions. [2021-12-17 22:16:44,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 232 transitions, 1726 flow [2021-12-17 22:16:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 22:16:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-17 22:16:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1729 transitions. [2021-12-17 22:16:44,501 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2021-12-17 22:16:44,501 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1729 transitions. [2021-12-17 22:16:44,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1729 transitions. [2021-12-17 22:16:44,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:44,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1729 transitions. [2021-12-17 22:16:44,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 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-17 22:16:44,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 140.0) internal successors, (2240), 16 states have internal predecessors, (2240), 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-17 22:16:44,505 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 140.0) internal successors, (2240), 16 states have internal predecessors, (2240), 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-17 22:16:44,505 INFO L186 Difference]: Start difference. First operand has 200 places, 166 transitions, 870 flow. Second operand 15 states and 1729 transitions. [2021-12-17 22:16:44,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 232 transitions, 1726 flow [2021-12-17 22:16:44,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 232 transitions, 1396 flow, removed 125 selfloop flow, removed 27 redundant places. [2021-12-17 22:16:44,783 INFO L242 Difference]: Finished difference. Result has 188 places, 187 transitions, 920 flow [2021-12-17 22:16:44,783 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=920, PETRI_PLACES=188, PETRI_TRANSITIONS=187} [2021-12-17 22:16:44,783 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 41 predicate places. [2021-12-17 22:16:44,784 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 187 transitions, 920 flow [2021-12-17 22:16:44,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.92307692307692) internal successors, (1455), 13 states have internal predecessors, (1455), 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-17 22:16:44,784 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:44,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:44,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 22:16:44,784 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:44,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1616761798, now seen corresponding path program 2 times [2021-12-17 22:16:44,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:44,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883121444] [2021-12-17 22:16:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:44,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:44,984 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-17 22:16:44,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:44,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883121444] [2021-12-17 22:16:44,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883121444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:44,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:44,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:16:44,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908372987] [2021-12-17 22:16:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:44,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:16:44,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:16:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:16:44,987 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2021-12-17 22:16:44,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 187 transitions, 920 flow. Second operand has 12 states, 12 states have (on average 112.08333333333333) internal successors, (1345), 12 states have internal predecessors, (1345), 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-17 22:16:44,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:44,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2021-12-17 22:16:44,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:46,125 INFO L129 PetriNetUnfolder]: 2178/9870 cut-off events. [2021-12-17 22:16:46,125 INFO L130 PetriNetUnfolder]: For 8462/9921 co-relation queries the response was YES. [2021-12-17 22:16:46,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22086 conditions, 9870 events. 2178/9870 cut-off events. For 8462/9921 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 138536 event pairs, 11 based on Foata normal form. 86/9143 useless extension candidates. Maximal degree in co-relation 22059. Up to 1542 conditions per place. [2021-12-17 22:16:46,209 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 57 selfloop transitions, 14 changer transitions 57/239 dead transitions. [2021-12-17 22:16:46,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 239 transitions, 1580 flow [2021-12-17 22:16:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:16:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:16:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1614 transitions. [2021-12-17 22:16:46,212 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.823469387755102 [2021-12-17 22:16:46,212 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1614 transitions. [2021-12-17 22:16:46,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1614 transitions. [2021-12-17 22:16:46,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:46,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1614 transitions. [2021-12-17 22:16:46,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.28571428571429) internal successors, (1614), 14 states have internal predecessors, (1614), 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-17 22:16:46,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 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-17 22:16:46,216 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 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-17 22:16:46,216 INFO L186 Difference]: Start difference. First operand has 188 places, 187 transitions, 920 flow. Second operand 14 states and 1614 transitions. [2021-12-17 22:16:46,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 239 transitions, 1580 flow [2021-12-17 22:16:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 239 transitions, 1538 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-12-17 22:16:46,272 INFO L242 Difference]: Finished difference. Result has 196 places, 168 transitions, 758 flow [2021-12-17 22:16:46,273 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=758, PETRI_PLACES=196, PETRI_TRANSITIONS=168} [2021-12-17 22:16:46,274 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 49 predicate places. [2021-12-17 22:16:46,274 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 168 transitions, 758 flow [2021-12-17 22:16:46,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.08333333333333) internal successors, (1345), 12 states have internal predecessors, (1345), 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-17 22:16:46,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:46,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:46,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 22:16:46,275 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 440352694, now seen corresponding path program 3 times [2021-12-17 22:16:46,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834221448] [2021-12-17 22:16:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:46,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:46,372 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-17 22:16:46,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834221448] [2021-12-17 22:16:46,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834221448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:46,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:46,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:16:46,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937589749] [2021-12-17 22:16:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:46,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:16:46,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:46,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:16:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:16:46,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-17 22:16:46,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 168 transitions, 758 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-17 22:16:46,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:46,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-17 22:16:46,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:47,096 INFO L129 PetriNetUnfolder]: 1558/6871 cut-off events. [2021-12-17 22:16:47,097 INFO L130 PetriNetUnfolder]: For 7919/8392 co-relation queries the response was YES. [2021-12-17 22:16:47,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16290 conditions, 6871 events. 1558/6871 cut-off events. For 7919/8392 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 86438 event pairs, 103 based on Foata normal form. 139/6572 useless extension candidates. Maximal degree in co-relation 16260. Up to 914 conditions per place. [2021-12-17 22:16:47,150 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 32 selfloop transitions, 1 changer transitions 75/225 dead transitions. [2021-12-17 22:16:47,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 225 transitions, 1450 flow [2021-12-17 22:16:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:16:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:16:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2021-12-17 22:16:47,151 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8540816326530613 [2021-12-17 22:16:47,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2021-12-17 22:16:47,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2021-12-17 22:16:47,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:47,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2021-12-17 22:16:47,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 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-17 22:16:47,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-17 22:16:47,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-17 22:16:47,154 INFO L186 Difference]: Start difference. First operand has 196 places, 168 transitions, 758 flow. Second operand 7 states and 837 transitions. [2021-12-17 22:16:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 225 transitions, 1450 flow [2021-12-17 22:16:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 225 transitions, 1404 flow, removed 11 selfloop flow, removed 10 redundant places. [2021-12-17 22:16:47,200 INFO L242 Difference]: Finished difference. Result has 186 places, 148 transitions, 561 flow [2021-12-17 22:16:47,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=561, PETRI_PLACES=186, PETRI_TRANSITIONS=148} [2021-12-17 22:16:47,200 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 39 predicate places. [2021-12-17 22:16:47,200 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 148 transitions, 561 flow [2021-12-17 22:16:47,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-17 22:16:47,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:47,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:47,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 22:16:47,201 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash -225931410, now seen corresponding path program 4 times [2021-12-17 22:16:47,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:47,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688233195] [2021-12-17 22:16:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:47,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:16:47,472 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-17 22:16:47,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:16:47,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688233195] [2021-12-17 22:16:47,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688233195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:16:47,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:16:47,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-17 22:16:47,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629845582] [2021-12-17 22:16:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:16:47,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 22:16:47,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:16:47,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 22:16:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:16:47,474 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2021-12-17 22:16:47,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 148 transitions, 561 flow. Second operand has 14 states, 14 states have (on average 110.85714285714286) internal successors, (1552), 14 states have internal predecessors, (1552), 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-17 22:16:47,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:16:47,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2021-12-17 22:16:47,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:16:47,882 INFO L129 PetriNetUnfolder]: 595/3269 cut-off events. [2021-12-17 22:16:47,882 INFO L130 PetriNetUnfolder]: For 2250/2680 co-relation queries the response was YES. [2021-12-17 22:16:47,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6835 conditions, 3269 events. 595/3269 cut-off events. For 2250/2680 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 37673 event pairs, 11 based on Foata normal form. 11/3031 useless extension candidates. Maximal degree in co-relation 6806. Up to 532 conditions per place. [2021-12-17 22:16:47,902 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 32 selfloop transitions, 10 changer transitions 11/163 dead transitions. [2021-12-17 22:16:47,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 163 transitions, 773 flow [2021-12-17 22:16:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:16:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:16:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1241 transitions. [2021-12-17 22:16:47,903 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058441558441558 [2021-12-17 22:16:47,904 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1241 transitions. [2021-12-17 22:16:47,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1241 transitions. [2021-12-17 22:16:47,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:16:47,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1241 transitions. [2021-12-17 22:16:47,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.81818181818181) internal successors, (1241), 11 states have internal predecessors, (1241), 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-17 22:16:47,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-17 22:16:47,908 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-17 22:16:47,908 INFO L186 Difference]: Start difference. First operand has 186 places, 148 transitions, 561 flow. Second operand 11 states and 1241 transitions. [2021-12-17 22:16:47,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 163 transitions, 773 flow [2021-12-17 22:16:47,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 163 transitions, 697 flow, removed 30 selfloop flow, removed 10 redundant places. [2021-12-17 22:16:47,922 INFO L242 Difference]: Finished difference. Result has 181 places, 147 transitions, 546 flow [2021-12-17 22:16:47,922 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=546, PETRI_PLACES=181, PETRI_TRANSITIONS=147} [2021-12-17 22:16:47,923 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 34 predicate places. [2021-12-17 22:16:47,923 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 147 transitions, 546 flow [2021-12-17 22:16:47,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.85714285714286) internal successors, (1552), 14 states have internal predecessors, (1552), 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-17 22:16:47,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:16:47,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:47,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 22:16:47,924 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:16:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:16:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2047641800, now seen corresponding path program 5 times [2021-12-17 22:16:47,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:16:47,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752634148] [2021-12-17 22:16:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:16:47,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:16:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:16:47,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 22:16:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:16:48,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 22:16:48,031 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 22:16:48,032 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-17 22:16:48,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-17 22:16:48,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-17 22:16:48,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-17 22:16:48,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-17 22:16:48,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-17 22:16:48,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-17 22:16:48,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 22:16:48,038 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:16:48,043 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:16:48,043 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:16:48,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:16:48 BasicIcfg [2021-12-17 22:16:48,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:16:48,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:16:48,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:16:48,185 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:16:48,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:16:24" (3/4) ... [2021-12-17 22:16:48,186 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 22:16:48,301 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:16:48,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:16:48,302 INFO L158 Benchmark]: Toolchain (without parser) took 25166.77ms. Allocated memory was 83.9MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 50.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 602.1MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,302 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:16:48,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.60ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 50.6MB in the beginning and 74.9MB in the end (delta: -24.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.31ms. Allocated memory is still 111.1MB. Free memory was 74.9MB in the beginning and 71.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,303 INFO L158 Benchmark]: Boogie Preprocessor took 41.96ms. Allocated memory is still 111.1MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,303 INFO L158 Benchmark]: RCFGBuilder took 878.98ms. Allocated memory is still 111.1MB. Free memory was 69.0MB in the beginning and 81.5MB in the end (delta: -12.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,303 INFO L158 Benchmark]: TraceAbstraction took 23571.54ms. Allocated memory was 111.1MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 80.8MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 552.0MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,304 INFO L158 Benchmark]: Witness Printer took 116.83ms. Allocated memory is still 2.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-17 22:16:48,305 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.60ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 50.6MB in the beginning and 74.9MB in the end (delta: -24.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.31ms. Allocated memory is still 111.1MB. Free memory was 74.9MB in the beginning and 71.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.96ms. Allocated memory is still 111.1MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 878.98ms. Allocated memory is still 111.1MB. Free memory was 69.0MB in the beginning and 81.5MB in the end (delta: -12.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23571.54ms. Allocated memory was 111.1MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 80.8MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 552.0MB. Max. memory is 16.1GB. * Witness Printer took 116.83ms. Allocated memory is still 2.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t145; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 863]: 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: 859]: 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: 865]: 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: 861]: 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 9 procedures, 178 locations, 7 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: 23.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1207 mSDsluCounter, 806 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1713 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2957 IncrementalHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 149 mSDtfsCounter, 2957 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1650occurred in iteration=10, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1766 NumberOfCodeBlocks, 1766 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1640 ConstructedInterpolants, 0 QuantifiedInterpolants, 9259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-17 22:16:48,345 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