./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:37:31,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:37:31,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:37:31,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:37:31,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:37:31,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:37:31,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:37:31,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:37:31,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:37:31,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:37:31,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:37:31,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:37:31,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:37:31,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:37:31,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:37:31,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:37:31,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:37:31,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:37:31,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:37:31,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:37:31,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:37:31,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:37:31,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:37:31,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:37:31,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:37:31,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:37:31,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:37:31,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:37:31,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:37:31,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:37:31,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:37:31,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:37:31,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:37:31,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:37:31,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:37:31,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:37:31,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:37:31,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:37:31,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:37:31,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:37:31,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:37:31,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:37:31,653 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:37:31,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:37:31,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:37:31,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:37:31,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:37:31,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:37:31,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:37:31,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:37:31,658 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:37:31,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:37:31,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:37:31,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:37:31,661 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:37:31,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:37:31,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:37:31,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:37:31,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:37:31,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:37:31,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:37:31,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2021-12-14 16:37:31,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:37:31,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:37:31,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:37:31,881 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:37:31,881 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:37:31,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-14 16:37:31,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1991f04c8/0559137426164d8b867f26da0e11ac5f/FLAGc4e6e9404 [2021-12-14 16:37:32,390 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:37:32,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-14 16:37:32,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1991f04c8/0559137426164d8b867f26da0e11ac5f/FLAGc4e6e9404 [2021-12-14 16:37:32,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1991f04c8/0559137426164d8b867f26da0e11ac5f [2021-12-14 16:37:32,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:37:32,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:37:32,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:37:32,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:37:32,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:37:32,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46721b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32, skipping insertion in model container [2021-12-14 16:37:32,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:37:32,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:37:32,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-14 16:37:32,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:37:32,750 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:37:32,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-14 16:37:32,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:37:32,804 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:37:32,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32 WrapperNode [2021-12-14 16:37:32,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:37:32,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:37:32,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:37:32,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:37:32,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,861 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2021-12-14 16:37:32,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:37:32,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:37:32,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:37:32,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:37:32,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:37:32,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:37:32,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:37:32,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:37:32,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (1/1) ... [2021-12-14 16:37:32,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:37:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:37:32,965 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-14 16:37:32,972 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-14 16:37:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:37:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:37:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:37:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:37:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:37:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-14 16:37:32,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-14 16:37:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-14 16:37:32,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-14 16:37:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-14 16:37:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-14 16:37:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:37:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:37:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:37:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:37:32,999 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:37:33,083 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:37:33,084 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:37:33,480 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:37:33,668 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:37:33,669 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 16:37:33,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:33 BoogieIcfgContainer [2021-12-14 16:37:33,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:37:33,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:37:33,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:37:33,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:37:33,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:37:32" (1/3) ... [2021-12-14 16:37:33,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45111c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:37:33, skipping insertion in model container [2021-12-14 16:37:33,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:32" (2/3) ... [2021-12-14 16:37:33,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45111c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:37:33, skipping insertion in model container [2021-12-14 16:37:33,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:33" (3/3) ... [2021-12-14 16:37:33,676 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-14 16:37:33,679 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:37:33,679 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:37:33,680 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:37:33,680 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:37:33,713 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,714 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,714 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,715 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,715 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,717 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,717 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,717 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,718 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,719 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,719 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,719 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,719 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,720 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,721 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,722 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,722 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,722 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,722 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,723 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,723 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,723 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,724 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,725 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,725 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,725 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,727 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,727 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,727 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,727 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,727 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,728 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,729 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,730 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,731 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,731 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,731 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,732 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,733 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,734 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,734 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,734 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,737 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,745 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,746 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,747 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,747 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,747 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,747 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,749 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,750 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,751 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,755 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,755 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,756 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,756 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,756 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,757 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,758 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,758 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,759 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,759 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,759 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,759 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,759 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,761 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:37:33,764 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-14 16:37:33,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:37:33,809 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-14 16:37:33,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-14 16:37:33,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-12-14 16:37:33,882 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-12-14 16:37:33,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:37:33,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-12-14 16:37:33,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-12-14 16:37:33,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-12-14 16:37:33,927 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-12-14 16:37:33,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:37:33,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:33,928 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] [2021-12-14 16:37:33,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash 67631088, now seen corresponding path program 1 times [2021-12-14 16:37:33,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858523379] [2021-12-14 16:37:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:33,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:34,215 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-14 16:37:34,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:34,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858523379] [2021-12-14 16:37:34,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858523379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:34,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:34,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:37:34,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728388556] [2021-12-14 16:37:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:34,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:37:34,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:37:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:37:34,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2021-12-14 16:37:34,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:34,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2021-12-14 16:37:34,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:34,355 INFO L129 PetriNetUnfolder]: 37/222 cut-off events. [2021-12-14 16:37:34,355 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-14 16:37:34,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 222 events. 37/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 704 event pairs, 7 based on Foata normal form. 11/217 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2021-12-14 16:37:34,359 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2021-12-14 16:37:34,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 260 flow [2021-12-14 16:37:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:37:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:37:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2021-12-14 16:37:34,374 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2021-12-14 16:37:34,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2021-12-14 16:37:34,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2021-12-14 16:37:34,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:34,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2021-12-14 16:37:34,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,393 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2021-12-14 16:37:34,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 260 flow [2021-12-14 16:37:34,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-14 16:37:34,401 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-12-14 16:37:34,402 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-12-14 16:37:34,405 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-12-14 16:37:34,406 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-12-14 16:37:34,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:34,406 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] [2021-12-14 16:37:34,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:37:34,407 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -764172337, now seen corresponding path program 1 times [2021-12-14 16:37:34,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:34,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583705250] [2021-12-14 16:37:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:34,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:34,639 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-14 16:37:34,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583705250] [2021-12-14 16:37:34,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583705250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:34,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:34,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:37:34,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413131835] [2021-12-14 16:37:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:34,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:37:34,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:37:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:37:34,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-14 16:37:34,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:34,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:34,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-14 16:37:34,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:35,254 INFO L129 PetriNetUnfolder]: 1109/3098 cut-off events. [2021-12-14 16:37:35,255 INFO L130 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2021-12-14 16:37:35,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 3098 events. 1109/3098 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 25992 event pairs, 268 based on Foata normal form. 0/3005 useless extension candidates. Maximal degree in co-relation 5010. Up to 679 conditions per place. [2021-12-14 16:37:35,272 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 5 changer transitions 61/169 dead transitions. [2021-12-14 16:37:35,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 532 flow [2021-12-14 16:37:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:37:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:37:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2021-12-14 16:37:35,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8635477582846004 [2021-12-14 16:37:35,276 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2021-12-14 16:37:35,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2021-12-14 16:37:35,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:35,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2021-12-14 16:37:35,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,281 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 886 transitions. [2021-12-14 16:37:35,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 532 flow [2021-12-14 16:37:35,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:37:35,286 INFO L242 Difference]: Finished difference. Result has 129 places, 98 transitions, 255 flow [2021-12-14 16:37:35,287 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=255, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2021-12-14 16:37:35,287 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-12-14 16:37:35,288 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 255 flow [2021-12-14 16:37:35,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,288 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:35,288 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] [2021-12-14 16:37:35,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:37:35,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash -830862450, now seen corresponding path program 1 times [2021-12-14 16:37:35,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:35,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465894404] [2021-12-14 16:37:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:35,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:35,452 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-14 16:37:35,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:35,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465894404] [2021-12-14 16:37:35,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465894404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:35,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:35,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:37:35,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931989265] [2021-12-14 16:37:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:35,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:37:35,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:37:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:37:35,457 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-14 16:37:35,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:35,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-14 16:37:35,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:35,890 INFO L129 PetriNetUnfolder]: 697/1452 cut-off events. [2021-12-14 16:37:35,890 INFO L130 PetriNetUnfolder]: For 1635/1635 co-relation queries the response was YES. [2021-12-14 16:37:35,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1452 events. 697/1452 cut-off events. For 1635/1635 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8816 event pairs, 75 based on Foata normal form. 30/1433 useless extension candidates. Maximal degree in co-relation 3884. Up to 454 conditions per place. [2021-12-14 16:37:35,899 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 30 selfloop transitions, 6 changer transitions 49/160 dead transitions. [2021-12-14 16:37:35,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 688 flow [2021-12-14 16:37:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:37:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:37:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1244 transitions. [2021-12-14 16:37:35,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8394062078272605 [2021-12-14 16:37:35,902 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1244 transitions. [2021-12-14 16:37:35,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1244 transitions. [2021-12-14 16:37:35,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:35,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1244 transitions. [2021-12-14 16:37:35,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.6923076923077) internal successors, (1244), 13 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,908 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,908 INFO L186 Difference]: Start difference. First operand has 129 places, 98 transitions, 255 flow. Second operand 13 states and 1244 transitions. [2021-12-14 16:37:35,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 688 flow [2021-12-14 16:37:35,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 652 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-12-14 16:37:35,915 INFO L242 Difference]: Finished difference. Result has 130 places, 99 transitions, 288 flow [2021-12-14 16:37:35,915 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=288, PETRI_PLACES=130, PETRI_TRANSITIONS=99} [2021-12-14 16:37:35,916 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2021-12-14 16:37:35,916 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 99 transitions, 288 flow [2021-12-14 16:37:35,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:35,917 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:35,917 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] [2021-12-14 16:37:35,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:37:35,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1326470898, now seen corresponding path program 1 times [2021-12-14 16:37:35,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:35,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396192903] [2021-12-14 16:37:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:35,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:36,002 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-14 16:37:36,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:36,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396192903] [2021-12-14 16:37:36,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396192903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:36,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:36,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:37:36,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838831763] [2021-12-14 16:37:36,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:36,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:37:36,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:37:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:37:36,005 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-14 16:37:36,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 99 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:36,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-14 16:37:36,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:36,440 INFO L129 PetriNetUnfolder]: 670/1482 cut-off events. [2021-12-14 16:37:36,440 INFO L130 PetriNetUnfolder]: For 2957/2957 co-relation queries the response was YES. [2021-12-14 16:37:36,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 1482 events. 670/1482 cut-off events. For 2957/2957 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9414 event pairs, 62 based on Foata normal form. 39/1474 useless extension candidates. Maximal degree in co-relation 4352. Up to 417 conditions per place. [2021-12-14 16:37:36,450 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 30 selfloop transitions, 8 changer transitions 52/165 dead transitions. [2021-12-14 16:37:36,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 165 transitions, 793 flow [2021-12-14 16:37:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:37:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:37:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1249 transitions. [2021-12-14 16:37:36,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8427800269905533 [2021-12-14 16:37:36,454 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1249 transitions. [2021-12-14 16:37:36,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1249 transitions. [2021-12-14 16:37:36,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:36,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1249 transitions. [2021-12-14 16:37:36,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.07692307692308) internal successors, (1249), 13 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,460 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,460 INFO L186 Difference]: Start difference. First operand has 130 places, 99 transitions, 288 flow. Second operand 13 states and 1249 transitions. [2021-12-14 16:37:36,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 165 transitions, 793 flow [2021-12-14 16:37:36,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 691 flow, removed 40 selfloop flow, removed 11 redundant places. [2021-12-14 16:37:36,469 INFO L242 Difference]: Finished difference. Result has 132 places, 100 transitions, 305 flow [2021-12-14 16:37:36,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=305, PETRI_PLACES=132, PETRI_TRANSITIONS=100} [2021-12-14 16:37:36,471 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2021-12-14 16:37:36,471 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 100 transitions, 305 flow [2021-12-14 16:37:36,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,472 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:36,472 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:36,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:37:36,473 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1400569395, now seen corresponding path program 1 times [2021-12-14 16:37:36,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:36,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90086827] [2021-12-14 16:37:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:36,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:36,612 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-14 16:37:36,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90086827] [2021-12-14 16:37:36,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90086827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:36,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:36,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:37:36,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987890185] [2021-12-14 16:37:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:36,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:37:36,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:37:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:37:36,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-14 16:37:36,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 100 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:36,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:36,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-14 16:37:36,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:37,103 INFO L129 PetriNetUnfolder]: 834/1882 cut-off events. [2021-12-14 16:37:37,103 INFO L130 PetriNetUnfolder]: For 4062/4070 co-relation queries the response was YES. [2021-12-14 16:37:37,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 1882 events. 834/1882 cut-off events. For 4062/4070 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12324 event pairs, 123 based on Foata normal form. 36/1838 useless extension candidates. Maximal degree in co-relation 5485. Up to 324 conditions per place. [2021-12-14 16:37:37,117 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 49 selfloop transitions, 19 changer transitions 68/209 dead transitions. [2021-12-14 16:37:37,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 209 transitions, 1218 flow [2021-12-14 16:37:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:37:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-14 16:37:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1604 transitions. [2021-12-14 16:37:37,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8276573787409701 [2021-12-14 16:37:37,149 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1604 transitions. [2021-12-14 16:37:37,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1604 transitions. [2021-12-14 16:37:37,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:37,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1604 transitions. [2021-12-14 16:37:37,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 94.3529411764706) internal successors, (1604), 17 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,156 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,156 INFO L186 Difference]: Start difference. First operand has 132 places, 100 transitions, 305 flow. Second operand 17 states and 1604 transitions. [2021-12-14 16:37:37,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 209 transitions, 1218 flow [2021-12-14 16:37:37,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 209 transitions, 1022 flow, removed 68 selfloop flow, removed 11 redundant places. [2021-12-14 16:37:37,167 INFO L242 Difference]: Finished difference. Result has 144 places, 113 transitions, 505 flow [2021-12-14 16:37:37,167 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=505, PETRI_PLACES=144, PETRI_TRANSITIONS=113} [2021-12-14 16:37:37,169 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2021-12-14 16:37:37,170 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 113 transitions, 505 flow [2021-12-14 16:37:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:37,170 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:37,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:37:37,171 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:37,171 INFO L85 PathProgramCache]: Analyzing trace with hash -517693363, now seen corresponding path program 2 times [2021-12-14 16:37:37,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697963614] [2021-12-14 16:37:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:37,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:37,263 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-14 16:37:37,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697963614] [2021-12-14 16:37:37,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697963614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:37,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:37,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:37:37,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630138074] [2021-12-14 16:37:37,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:37,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:37:37,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:37:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:37:37,266 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-14 16:37:37,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 113 transitions, 505 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:37,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-14 16:37:37,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:37,650 INFO L129 PetriNetUnfolder]: 744/1683 cut-off events. [2021-12-14 16:37:37,651 INFO L130 PetriNetUnfolder]: For 11506/11506 co-relation queries the response was YES. [2021-12-14 16:37:37,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 1683 events. 744/1683 cut-off events. For 11506/11506 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10722 event pairs, 145 based on Foata normal form. 40/1622 useless extension candidates. Maximal degree in co-relation 6663. Up to 321 conditions per place. [2021-12-14 16:37:37,661 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 32 selfloop transitions, 10 changer transitions 62/177 dead transitions. [2021-12-14 16:37:37,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 177 transitions, 1296 flow [2021-12-14 16:37:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:37:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:37:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1038 transitions. [2021-12-14 16:37:37,664 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8277511961722488 [2021-12-14 16:37:37,664 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1038 transitions. [2021-12-14 16:37:37,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1038 transitions. [2021-12-14 16:37:37,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:37,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1038 transitions. [2021-12-14 16:37:37,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,668 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,668 INFO L186 Difference]: Start difference. First operand has 144 places, 113 transitions, 505 flow. Second operand 11 states and 1038 transitions. [2021-12-14 16:37:37,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 177 transitions, 1296 flow [2021-12-14 16:37:37,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 177 transitions, 1094 flow, removed 101 selfloop flow, removed 9 redundant places. [2021-12-14 16:37:37,685 INFO L242 Difference]: Finished difference. Result has 141 places, 102 transitions, 381 flow [2021-12-14 16:37:37,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=381, PETRI_PLACES=141, PETRI_TRANSITIONS=102} [2021-12-14 16:37:37,686 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2021-12-14 16:37:37,686 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 102 transitions, 381 flow [2021-12-14 16:37:37,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,686 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:37,687 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:37,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:37:37,687 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 83300515, now seen corresponding path program 1 times [2021-12-14 16:37:37,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200144718] [2021-12-14 16:37:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:37,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:37,747 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-14 16:37:37,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:37,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200144718] [2021-12-14 16:37:37,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200144718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:37,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:37,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:37:37,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68884577] [2021-12-14 16:37:37,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:37,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:37:37,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:37:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:37:37,750 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-14 16:37:37,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 102 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:37,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:37,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-14 16:37:37,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:38,119 INFO L129 PetriNetUnfolder]: 1217/2515 cut-off events. [2021-12-14 16:37:38,119 INFO L130 PetriNetUnfolder]: For 5722/5959 co-relation queries the response was YES. [2021-12-14 16:37:38,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 2515 events. 1217/2515 cut-off events. For 5722/5959 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17228 event pairs, 96 based on Foata normal form. 76/2481 useless extension candidates. Maximal degree in co-relation 6555. Up to 704 conditions per place. [2021-12-14 16:37:38,134 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 32 selfloop transitions, 7 changer transitions 48/169 dead transitions. [2021-12-14 16:37:38,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 847 flow [2021-12-14 16:37:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:37:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:37:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 991 transitions. [2021-12-14 16:37:38,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8692982456140351 [2021-12-14 16:37:38,136 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 991 transitions. [2021-12-14 16:37:38,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 991 transitions. [2021-12-14 16:37:38,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:38,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 991 transitions. [2021-12-14 16:37:38,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,140 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,140 INFO L186 Difference]: Start difference. First operand has 141 places, 102 transitions, 381 flow. Second operand 10 states and 991 transitions. [2021-12-14 16:37:38,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 847 flow [2021-12-14 16:37:38,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 169 transitions, 705 flow, removed 27 selfloop flow, removed 16 redundant places. [2021-12-14 16:37:38,146 INFO L242 Difference]: Finished difference. Result has 134 places, 106 transitions, 364 flow [2021-12-14 16:37:38,146 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=134, PETRI_TRANSITIONS=106} [2021-12-14 16:37:38,147 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-12-14 16:37:38,147 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 106 transitions, 364 flow [2021-12-14 16:37:38,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:38,147 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] [2021-12-14 16:37:38,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:37:38,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2110825476, now seen corresponding path program 1 times [2021-12-14 16:37:38,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953032103] [2021-12-14 16:37:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:38,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:38,221 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-14 16:37:38,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953032103] [2021-12-14 16:37:38,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953032103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:38,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:38,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:37:38,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216355627] [2021-12-14 16:37:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:38,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:37:38,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:37:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:37:38,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-14 16:37:38,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 106 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:38,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-14 16:37:38,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:38,552 INFO L129 PetriNetUnfolder]: 599/1525 cut-off events. [2021-12-14 16:37:38,553 INFO L130 PetriNetUnfolder]: For 2489/2570 co-relation queries the response was YES. [2021-12-14 16:37:38,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 1525 events. 599/1525 cut-off events. For 2489/2570 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10320 event pairs, 66 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 4629. Up to 387 conditions per place. [2021-12-14 16:37:38,561 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 11 changer transitions 42/174 dead transitions. [2021-12-14 16:37:38,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 943 flow [2021-12-14 16:37:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:37:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:37:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1086 transitions. [2021-12-14 16:37:38,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8660287081339713 [2021-12-14 16:37:38,564 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1086 transitions. [2021-12-14 16:37:38,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1086 transitions. [2021-12-14 16:37:38,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:38,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1086 transitions. [2021-12-14 16:37:38,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.72727272727273) internal successors, (1086), 11 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,569 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,569 INFO L186 Difference]: Start difference. First operand has 134 places, 106 transitions, 364 flow. Second operand 11 states and 1086 transitions. [2021-12-14 16:37:38,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 943 flow [2021-12-14 16:37:38,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 174 transitions, 920 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-14 16:37:38,575 INFO L242 Difference]: Finished difference. Result has 142 places, 112 transitions, 458 flow [2021-12-14 16:37:38,575 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=458, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2021-12-14 16:37:38,577 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 23 predicate places. [2021-12-14 16:37:38,577 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 458 flow [2021-12-14 16:37:38,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,577 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:38,578 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:38,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:37:38,578 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -289492209, now seen corresponding path program 1 times [2021-12-14 16:37:38,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261303397] [2021-12-14 16:37:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:38,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:38,667 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-14 16:37:38,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:38,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261303397] [2021-12-14 16:37:38,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261303397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:38,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:38,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:37:38,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756836456] [2021-12-14 16:37:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:38,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:37:38,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:37:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:37:38,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-14 16:37:38,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 458 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:38,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-14 16:37:38,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:38,958 INFO L129 PetriNetUnfolder]: 397/1103 cut-off events. [2021-12-14 16:37:38,959 INFO L130 PetriNetUnfolder]: For 3189/3277 co-relation queries the response was YES. [2021-12-14 16:37:38,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 1103 events. 397/1103 cut-off events. For 3189/3277 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7706 event pairs, 66 based on Foata normal form. 57/1121 useless extension candidates. Maximal degree in co-relation 3762. Up to 227 conditions per place. [2021-12-14 16:37:38,965 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 26 selfloop transitions, 14 changer transitions 34/156 dead transitions. [2021-12-14 16:37:38,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 884 flow [2021-12-14 16:37:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:37:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:37:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2021-12-14 16:37:38,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.844804318488529 [2021-12-14 16:37:38,968 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2021-12-14 16:37:38,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2021-12-14 16:37:38,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:38,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2021-12-14 16:37:38,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,973 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,974 INFO L186 Difference]: Start difference. First operand has 142 places, 112 transitions, 458 flow. Second operand 13 states and 1252 transitions. [2021-12-14 16:37:38,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 884 flow [2021-12-14 16:37:38,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 834 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-12-14 16:37:38,997 INFO L242 Difference]: Finished difference. Result has 151 places, 112 transitions, 463 flow [2021-12-14 16:37:38,998 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=463, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2021-12-14 16:37:38,998 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2021-12-14 16:37:38,998 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 463 flow [2021-12-14 16:37:38,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:38,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:38,999 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:38,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:37:38,999 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1112647533, now seen corresponding path program 1 times [2021-12-14 16:37:39,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:39,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659359902] [2021-12-14 16:37:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:39,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:39,131 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-14 16:37:39,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:39,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659359902] [2021-12-14 16:37:39,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659359902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:39,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:39,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:37:39,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979269409] [2021-12-14 16:37:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:39,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:37:39,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:39,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:37:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:37:39,134 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-14 16:37:39,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:39,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-14 16:37:39,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:39,295 INFO L129 PetriNetUnfolder]: 106/672 cut-off events. [2021-12-14 16:37:39,295 INFO L130 PetriNetUnfolder]: For 1765/1858 co-relation queries the response was YES. [2021-12-14 16:37:39,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 672 events. 106/672 cut-off events. For 1765/1858 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5059 event pairs, 10 based on Foata normal form. 6/630 useless extension candidates. Maximal degree in co-relation 1902. Up to 137 conditions per place. [2021-12-14 16:37:39,300 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 19 selfloop transitions, 4 changer transitions 15/123 dead transitions. [2021-12-14 16:37:39,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 123 transitions, 565 flow [2021-12-14 16:37:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:37:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-14 16:37:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2021-12-14 16:37:39,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8258145363408521 [2021-12-14 16:37:39,302 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2021-12-14 16:37:39,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2021-12-14 16:37:39,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:39,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2021-12-14 16:37:39,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,305 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,305 INFO L186 Difference]: Start difference. First operand has 151 places, 112 transitions, 463 flow. Second operand 7 states and 659 transitions. [2021-12-14 16:37:39,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 123 transitions, 565 flow [2021-12-14 16:37:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 123 transitions, 470 flow, removed 32 selfloop flow, removed 17 redundant places. [2021-12-14 16:37:39,313 INFO L242 Difference]: Finished difference. Result has 140 places, 105 transitions, 340 flow [2021-12-14 16:37:39,313 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2021-12-14 16:37:39,314 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2021-12-14 16:37:39,314 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 340 flow [2021-12-14 16:37:39,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:39,315 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:39,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:37:39,315 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 8651161, now seen corresponding path program 2 times [2021-12-14 16:37:39,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:39,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3422265] [2021-12-14 16:37:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:39,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:39,513 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-14 16:37:39,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:39,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3422265] [2021-12-14 16:37:39,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3422265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:39,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:39,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:37:39,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200768185] [2021-12-14 16:37:39,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:39,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:37:39,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:37:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:37:39,515 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-14 16:37:39,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 340 flow. Second operand has 11 states, 11 states have (on average 89.9090909090909) internal successors, (989), 11 states have internal predecessors, (989), 0 states have call successors, (0), 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-14 16:37:39,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:39,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-14 16:37:39,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:39,668 INFO L129 PetriNetUnfolder]: 45/381 cut-off events. [2021-12-14 16:37:39,668 INFO L130 PetriNetUnfolder]: For 193/204 co-relation queries the response was YES. [2021-12-14 16:37:39,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 381 events. 45/381 cut-off events. For 193/204 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2270 event pairs, 1 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 773. Up to 67 conditions per place. [2021-12-14 16:37:39,671 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 19 selfloop transitions, 5 changer transitions 10/118 dead transitions. [2021-12-14 16:37:39,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 118 transitions, 450 flow [2021-12-14 16:37:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:37:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:37:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 915 transitions. [2021-12-14 16:37:39,673 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2021-12-14 16:37:39,673 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 915 transitions. [2021-12-14 16:37:39,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 915 transitions. [2021-12-14 16:37:39,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:39,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 915 transitions. [2021-12-14 16:37:39,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 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-14 16:37:39,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,677 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:39,677 INFO L186 Difference]: Start difference. First operand has 140 places, 105 transitions, 340 flow. Second operand 10 states and 915 transitions. [2021-12-14 16:37:39,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 118 transitions, 450 flow [2021-12-14 16:37:39,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 118 transitions, 396 flow, removed 12 selfloop flow, removed 13 redundant places. [2021-12-14 16:37:39,680 INFO L242 Difference]: Finished difference. Result has 138 places, 107 transitions, 331 flow [2021-12-14 16:37:39,680 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=331, PETRI_PLACES=138, PETRI_TRANSITIONS=107} [2021-12-14 16:37:39,680 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2021-12-14 16:37:39,681 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 107 transitions, 331 flow [2021-12-14 16:37:39,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.9090909090909) internal successors, (989), 11 states have internal predecessors, (989), 0 states have call successors, (0), 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-14 16:37:39,681 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:39,681 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:39,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:37:39,682 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1535276687, now seen corresponding path program 3 times [2021-12-14 16:37:39,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:39,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375744440] [2021-12-14 16:37:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:39,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:37:39,863 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-14 16:37:39,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:37:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375744440] [2021-12-14 16:37:39,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375744440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:37:39,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:37:39,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:37:39,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133090463] [2021-12-14 16:37:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:37:39,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:37:39,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:37:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:37:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:37:39,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-14 16:37:39,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 107 transitions, 331 flow. Second operand has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 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-14 16:37:39,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:37:39,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-14 16:37:39,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:37:40,053 INFO L129 PetriNetUnfolder]: 48/370 cut-off events. [2021-12-14 16:37:40,053 INFO L130 PetriNetUnfolder]: For 177/180 co-relation queries the response was YES. [2021-12-14 16:37:40,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 370 events. 48/370 cut-off events. For 177/180 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2160 event pairs, 0 based on Foata normal form. 3/359 useless extension candidates. Maximal degree in co-relation 732. Up to 66 conditions per place. [2021-12-14 16:37:40,055 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 19 selfloop transitions, 9 changer transitions 6/117 dead transitions. [2021-12-14 16:37:40,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 117 transitions, 435 flow [2021-12-14 16:37:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:37:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:37:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1165 transitions. [2021-12-14 16:37:40,057 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7860998650472335 [2021-12-14 16:37:40,057 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1165 transitions. [2021-12-14 16:37:40,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1165 transitions. [2021-12-14 16:37:40,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:37:40,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1165 transitions. [2021-12-14 16:37:40,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.61538461538461) internal successors, (1165), 13 states have internal predecessors, (1165), 0 states have call successors, (0), 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-14 16:37:40,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:40,061 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:37:40,061 INFO L186 Difference]: Start difference. First operand has 138 places, 107 transitions, 331 flow. Second operand 13 states and 1165 transitions. [2021-12-14 16:37:40,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 117 transitions, 435 flow [2021-12-14 16:37:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 117 transitions, 410 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-12-14 16:37:40,064 INFO L242 Difference]: Finished difference. Result has 143 places, 110 transitions, 358 flow [2021-12-14 16:37:40,064 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=358, PETRI_PLACES=143, PETRI_TRANSITIONS=110} [2021-12-14 16:37:40,064 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2021-12-14 16:37:40,065 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 110 transitions, 358 flow [2021-12-14 16:37:40,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 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-14 16:37:40,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:37:40,065 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:40,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:37:40,065 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:37:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:37:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -5457691, now seen corresponding path program 4 times [2021-12-14 16:37:40,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:37:40,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415499735] [2021-12-14 16:37:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:37:40,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:37:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:37:40,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:37:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:37:40,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:37:40,161 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:37:40,162 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-14 16:37:40,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-14 16:37:40,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-14 16:37:40,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-14 16:37:40,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-14 16:37:40,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-14 16:37:40,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:37:40,166 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:37:40,170 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:37:40,170 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:37:40,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:37:40 BasicIcfg [2021-12-14 16:37:40,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:37:40,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:37:40,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:37:40,280 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:37:40,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:33" (3/4) ... [2021-12-14 16:37:40,281 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:37:40,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:37:40,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:37:40,379 INFO L158 Benchmark]: Toolchain (without parser) took 7926.43ms. Allocated memory was 111.1MB in the beginning and 423.6MB in the end (delta: 312.5MB). Free memory was 80.4MB in the beginning and 280.6MB in the end (delta: -200.2MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,379 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory was 69.1MB in the beginning and 69.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:37:40,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.09ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 72.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.73ms. Allocated memory is still 111.1MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,380 INFO L158 Benchmark]: Boogie Preprocessor took 39.13ms. Allocated memory is still 111.1MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,380 INFO L158 Benchmark]: RCFGBuilder took 755.29ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 68.3MB in the beginning and 82.5MB in the end (delta: -14.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,380 INFO L158 Benchmark]: TraceAbstraction took 6607.39ms. Allocated memory was 146.8MB in the beginning and 423.6MB in the end (delta: 276.8MB). Free memory was 81.6MB in the beginning and 315.2MB in the end (delta: -233.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,380 INFO L158 Benchmark]: Witness Printer took 98.49ms. Allocated memory is still 423.6MB. Free memory was 315.2MB in the beginning and 280.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-14 16:37:40,382 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.17ms. Allocated memory is still 111.1MB. Free memory was 69.1MB in the beginning and 69.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.09ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 72.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.73ms. Allocated memory is still 111.1MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.13ms. Allocated memory is still 111.1MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.29ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 68.3MB in the beginning and 82.5MB in the end (delta: -14.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6607.39ms. Allocated memory was 146.8MB in the beginning and 423.6MB in the end (delta: 276.8MB). Free memory was 81.6MB in the beginning and 315.2MB in the end (delta: -233.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 98.49ms. Allocated memory is still 423.6MB. Free memory was 315.2MB in the beginning and 280.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1108 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1397 IncrementalHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 133 mSDtfsCounter, 1397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=5, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1035 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 3928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 16:37:40,423 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