./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix010.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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:01:27,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:01:27,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:01:27,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:01:27,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:01:27,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:01:27,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:01:27,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:01:27,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:01:27,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:01:27,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:01:27,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:01:27,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:01:27,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:01:27,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:01:27,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:01:27,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:01:27,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:01:27,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:01:27,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:01:27,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:01:27,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:01:27,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:01:27,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:01:27,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:01:27,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:01:27,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:01:27,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:01:27,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:01:27,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:01:27,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:01:27,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:01:27,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:01:27,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:01:27,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:01:27,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:01:27,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:01:27,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:01:27,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:01:27,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:01:27,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:01:27,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:01:28,018 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:01:28,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:01:28,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:01:28,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:01:28,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:01:28,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:01:28,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:01:28,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:01:28,021 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:01:28,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:01:28,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:01:28,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:01:28,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:01:28,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:01:28,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:28,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:01:28,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:01:28,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:01:28,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:01:28,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:01:28,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:01:28,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:01:28,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:01:28,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:01:28,026 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2021-12-21 15:01:28,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:01:28,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:01:28,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:01:28,242 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:01:28,242 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:01:28,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2021-12-21 15:01:28,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087502649/8a27881c74454d039c074b724b8c8243/FLAGd4f23e828 [2021-12-21 15:01:28,684 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:01:28,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2021-12-21 15:01:28,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087502649/8a27881c74454d039c074b724b8c8243/FLAGd4f23e828 [2021-12-21 15:01:29,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087502649/8a27881c74454d039c074b724b8c8243 [2021-12-21 15:01:29,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:01:29,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:01:29,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:29,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:01:29,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:01:29,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408839ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29, skipping insertion in model container [2021-12-21 15:01:29,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:01:29,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:01:29,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2021-12-21 15:01:29,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:29,378 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:01:29,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2021-12-21 15:01:29,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:29,479 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:01:29,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29 WrapperNode [2021-12-21 15:01:29,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:29,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:29,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:01:29,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:01:29,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,550 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 282 [2021-12-21 15:01:29,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:29,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:01:29,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:01:29,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:01:29,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:01:29,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:01:29,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:01:29,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:01:29,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (1/1) ... [2021-12-21 15:01:29,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:29,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:01:29,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 15:01:29,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 15:01:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:01:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:01:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:01:29,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:01:29,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:01:29,676 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:01:29,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:01:29,676 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:01:29,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:01:29,676 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-21 15:01:29,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-21 15:01:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:01:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:01:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:01:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:01:29,678 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:01:29,824 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:01:29,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:01:30,297 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:01:30,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:01:30,599 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:01:30,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:30 BoogieIcfgContainer [2021-12-21 15:01:30,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:01:30,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:01:30,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:01:30,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:01:30,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:01:29" (1/3) ... [2021-12-21 15:01:30,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb79d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:30, skipping insertion in model container [2021-12-21 15:01:30,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:29" (2/3) ... [2021-12-21 15:01:30,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb79d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:30, skipping insertion in model container [2021-12-21 15:01:30,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:30" (3/3) ... [2021-12-21 15:01:30,608 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2021-12-21 15:01:30,612 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:01:30,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:01:30,612 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:01:30,612 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:01:30,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,652 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,652 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,653 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,653 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,655 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,655 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,665 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,666 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,670 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,676 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,676 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,676 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,677 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,684 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,689 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,711 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,717 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,717 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,717 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,717 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:30,717 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:01:30,759 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:01:30,768 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:01:30,769 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-21 15:01:30,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2021-12-21 15:01:30,827 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-12-21 15:01:30,827 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:30,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-12-21 15:01:30,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2021-12-21 15:01:30,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2021-12-21 15:01:30,851 INFO L129 PetriNetUnfolder]: 0/79 cut-off events. [2021-12-21 15:01:30,852 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:30,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:30,853 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] [2021-12-21 15:01:30,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2122282881, now seen corresponding path program 1 times [2021-12-21 15:01:30,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:30,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428737576] [2021-12-21 15:01:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:30,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:31,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:31,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428737576] [2021-12-21 15:01:31,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428737576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:31,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:31,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:01:31,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405283035] [2021-12-21 15:01:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:31,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:01:31,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:01:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:01:31,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2021-12-21 15:01:31,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:31,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2021-12-21 15:01:31,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:31,222 INFO L129 PetriNetUnfolder]: 14/194 cut-off events. [2021-12-21 15:01:31,222 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-21 15:01:31,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 194 events. 14/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 450 event pairs, 6 based on Foata normal form. 6/190 useless extension candidates. Maximal degree in co-relation 185. Up to 25 conditions per place. [2021-12-21 15:01:31,225 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2021-12-21 15:01:31,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 261 flow [2021-12-21 15:01:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:01:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:01:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2021-12-21 15:01:31,238 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2021-12-21 15:01:31,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2021-12-21 15:01:31,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2021-12-21 15:01:31,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:31,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2021-12-21 15:01:31,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,253 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 337 transitions. [2021-12-21 15:01:31,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 261 flow [2021-12-21 15:01:31,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 115 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-21 15:01:31,260 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2021-12-21 15:01:31,261 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2021-12-21 15:01:31,264 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2021-12-21 15:01:31,264 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2021-12-21 15:01:31,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,264 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:31,265 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:31,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:01:31,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash -740069111, now seen corresponding path program 1 times [2021-12-21 15:01:31,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:31,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498076570] [2021-12-21 15:01:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:31,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:31,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498076570] [2021-12-21 15:01:31,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498076570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:31,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:31,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:31,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070857298] [2021-12-21 15:01:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:31,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:31,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:31,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2021-12-21 15:01:31,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:31,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2021-12-21 15:01:31,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:31,897 INFO L129 PetriNetUnfolder]: 572/1518 cut-off events. [2021-12-21 15:01:31,897 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-12-21 15:01:31,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1518 events. 572/1518 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10439 event pairs, 109 based on Foata normal form. 0/1474 useless extension candidates. Maximal degree in co-relation 2426. Up to 405 conditions per place. [2021-12-21 15:01:31,906 INFO L132 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 4 changer transitions 51/156 dead transitions. [2021-12-21 15:01:31,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 460 flow [2021-12-21 15:01:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2021-12-21 15:01:31,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667 [2021-12-21 15:01:31,909 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 998 transitions. [2021-12-21 15:01:31,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 998 transitions. [2021-12-21 15:01:31,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:31,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 998 transitions. [2021-12-21 15:01:31,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.8) internal successors, (998), 10 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,926 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,926 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 10 states and 998 transitions. [2021-12-21 15:01:31,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 460 flow [2021-12-21 15:01:31,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 156 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:01:31,930 INFO L242 Difference]: Finished difference. Result has 136 places, 101 transitions, 232 flow [2021-12-21 15:01:31,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=136, PETRI_TRANSITIONS=101} [2021-12-21 15:01:31,931 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2021-12-21 15:01:31,931 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 232 flow [2021-12-21 15:01:31,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:31,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:31,932 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:31,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:01:31,932 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1467611513, now seen corresponding path program 1 times [2021-12-21 15:01:31,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:31,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139145650] [2021-12-21 15:01:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:31,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:32,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139145650] [2021-12-21 15:01:32,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139145650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:32,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:32,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:32,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493467835] [2021-12-21 15:01:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:32,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:32,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:32,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:32,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 120 [2021-12-21 15:01:32,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:32,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 120 [2021-12-21 15:01:32,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:32,276 INFO L129 PetriNetUnfolder]: 69/270 cut-off events. [2021-12-21 15:01:32,277 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2021-12-21 15:01:32,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 270 events. 69/270 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 924 event pairs, 13 based on Foata normal form. 6/265 useless extension candidates. Maximal degree in co-relation 464. Up to 81 conditions per place. [2021-12-21 15:01:32,278 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 19 selfloop transitions, 2 changer transitions 19/125 dead transitions. [2021-12-21 15:01:32,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 383 flow [2021-12-21 15:01:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:01:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:01:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2021-12-21 15:01:32,281 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2021-12-21 15:01:32,281 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 933 transitions. [2021-12-21 15:01:32,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 933 transitions. [2021-12-21 15:01:32,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:32,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 933 transitions. [2021-12-21 15:01:32,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,285 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,285 INFO L186 Difference]: Start difference. First operand has 136 places, 101 transitions, 232 flow. Second operand 9 states and 933 transitions. [2021-12-21 15:01:32,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 383 flow [2021-12-21 15:01:32,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 345 flow, removed 14 selfloop flow, removed 9 redundant places. [2021-12-21 15:01:32,292 INFO L242 Difference]: Finished difference. Result has 124 places, 101 transitions, 232 flow [2021-12-21 15:01:32,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2021-12-21 15:01:32,294 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -1 predicate places. [2021-12-21 15:01:32,294 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 232 flow [2021-12-21 15:01:32,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,295 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:32,295 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:32,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:01:32,296 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -362952167, now seen corresponding path program 1 times [2021-12-21 15:01:32,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576301319] [2021-12-21 15:01:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:32,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:32,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:32,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576301319] [2021-12-21 15:01:32,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576301319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:32,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:32,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:32,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717185547] [2021-12-21 15:01:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:32,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:32,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:32,422 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2021-12-21 15:01:32,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:32,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2021-12-21 15:01:32,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:32,684 INFO L129 PetriNetUnfolder]: 556/1227 cut-off events. [2021-12-21 15:01:32,685 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2021-12-21 15:01:32,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1227 events. 556/1227 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7764 event pairs, 16 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 2271. Up to 343 conditions per place. [2021-12-21 15:01:32,690 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 28 selfloop transitions, 6 changer transitions 45/161 dead transitions. [2021-12-21 15:01:32,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 161 transitions, 521 flow [2021-12-21 15:01:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2021-12-21 15:01:32,693 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2021-12-21 15:01:32,693 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2021-12-21 15:01:32,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2021-12-21 15:01:32,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:32,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2021-12-21 15:01:32,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,697 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,697 INFO L186 Difference]: Start difference. First operand has 124 places, 101 transitions, 232 flow. Second operand 10 states and 1051 transitions. [2021-12-21 15:01:32,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 161 transitions, 521 flow [2021-12-21 15:01:32,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 161 transitions, 505 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-12-21 15:01:32,704 INFO L242 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2021-12-21 15:01:32,704 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2021-12-21 15:01:32,705 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2021-12-21 15:01:32,705 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2021-12-21 15:01:32,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,706 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:32,706 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:32,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:01:32,706 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2079209316, now seen corresponding path program 1 times [2021-12-21 15:01:32,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:32,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102138692] [2021-12-21 15:01:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:32,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:32,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:32,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102138692] [2021-12-21 15:01:32,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102138692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:32,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:32,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:32,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728502313] [2021-12-21 15:01:32,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:32,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:32,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:32,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:32,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:32,850 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2021-12-21 15:01:32,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:32,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:32,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2021-12-21 15:01:32,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,063 INFO L129 PetriNetUnfolder]: 212/616 cut-off events. [2021-12-21 15:01:33,064 INFO L130 PetriNetUnfolder]: For 597/605 co-relation queries the response was YES. [2021-12-21 15:01:33,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 616 events. 212/616 cut-off events. For 597/605 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3368 event pairs, 4 based on Foata normal form. 22/637 useless extension candidates. Maximal degree in co-relation 1542. Up to 154 conditions per place. [2021-12-21 15:01:33,066 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 33 selfloop transitions, 9 changer transitions 35/159 dead transitions. [2021-12-21 15:01:33,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 159 transitions, 676 flow [2021-12-21 15:01:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2021-12-21 15:01:33,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2021-12-21 15:01:33,069 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2021-12-21 15:01:33,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2021-12-21 15:01:33,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2021-12-21 15:01:33,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,073 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,073 INFO L186 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 10 states and 1049 transitions. [2021-12-21 15:01:33,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 159 transitions, 676 flow [2021-12-21 15:01:33,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 159 transitions, 652 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:33,077 INFO L242 Difference]: Finished difference. Result has 129 places, 106 transitions, 338 flow [2021-12-21 15:01:33,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2021-12-21 15:01:33,078 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 4 predicate places. [2021-12-21 15:01:33,078 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 338 flow [2021-12-21 15:01:33,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,079 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,079 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:01:33,079 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -277973192, now seen corresponding path program 1 times [2021-12-21 15:01:33,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841307762] [2021-12-21 15:01:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:33,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:33,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841307762] [2021-12-21 15:01:33,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841307762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:33,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:33,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:01:33,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763395338] [2021-12-21 15:01:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:33,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:01:33,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:33,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:01:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:01:33,214 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2021-12-21 15:01:33,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:33,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2021-12-21 15:01:33,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,402 INFO L129 PetriNetUnfolder]: 65/270 cut-off events. [2021-12-21 15:01:33,402 INFO L130 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2021-12-21 15:01:33,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 270 events. 65/270 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 906 event pairs, 8 based on Foata normal form. 8/277 useless extension candidates. Maximal degree in co-relation 727. Up to 59 conditions per place. [2021-12-21 15:01:33,404 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 23 selfloop transitions, 12 changer transitions 21/138 dead transitions. [2021-12-21 15:01:33,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 138 transitions, 624 flow [2021-12-21 15:01:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:01:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:01:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1125 transitions. [2021-12-21 15:01:33,407 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8522727272727273 [2021-12-21 15:01:33,407 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1125 transitions. [2021-12-21 15:01:33,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1125 transitions. [2021-12-21 15:01:33,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1125 transitions. [2021-12-21 15:01:33,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.27272727272727) internal successors, (1125), 11 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,412 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,413 INFO L186 Difference]: Start difference. First operand has 129 places, 106 transitions, 338 flow. Second operand 11 states and 1125 transitions. [2021-12-21 15:01:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 138 transitions, 624 flow [2021-12-21 15:01:33,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 138 transitions, 517 flow, removed 40 selfloop flow, removed 11 redundant places. [2021-12-21 15:01:33,416 INFO L242 Difference]: Finished difference. Result has 130 places, 106 transitions, 320 flow [2021-12-21 15:01:33,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=320, PETRI_PLACES=130, PETRI_TRANSITIONS=106} [2021-12-21 15:01:33,419 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 5 predicate places. [2021-12-21 15:01:33,419 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 106 transitions, 320 flow [2021-12-21 15:01:33,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,420 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,420 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:01:33,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 47154554, now seen corresponding path program 1 times [2021-12-21 15:01:33,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033069622] [2021-12-21 15:01:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:33,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033069622] [2021-12-21 15:01:33,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033069622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:33,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:33,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:33,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243884436] [2021-12-21 15:01:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:33,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:33,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:33,562 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2021-12-21 15:01:33,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 106 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:33,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2021-12-21 15:01:33,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,743 INFO L129 PetriNetUnfolder]: 93/399 cut-off events. [2021-12-21 15:01:33,743 INFO L130 PetriNetUnfolder]: For 256/266 co-relation queries the response was YES. [2021-12-21 15:01:33,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 399 events. 93/399 cut-off events. For 256/266 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1784 event pairs, 10 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 797. Up to 108 conditions per place. [2021-12-21 15:01:33,745 INFO L132 encePairwiseOnDemand]: 107/120 looper letters, 27 selfloop transitions, 9 changer transitions 5/123 dead transitions. [2021-12-21 15:01:33,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 440 flow [2021-12-21 15:01:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:01:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-21 15:01:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2021-12-21 15:01:33,747 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2021-12-21 15:01:33,747 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2021-12-21 15:01:33,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2021-12-21 15:01:33,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2021-12-21 15:01:33,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,751 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,751 INFO L186 Difference]: Start difference. First operand has 130 places, 106 transitions, 320 flow. Second operand 8 states and 770 transitions. [2021-12-21 15:01:33,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 440 flow [2021-12-21 15:01:33,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 358 flow, removed 22 selfloop flow, removed 15 redundant places. [2021-12-21 15:01:33,754 INFO L242 Difference]: Finished difference. Result has 123 places, 110 transitions, 289 flow [2021-12-21 15:01:33,754 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2021-12-21 15:01:33,754 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2021-12-21 15:01:33,754 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 289 flow [2021-12-21 15:01:33,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,755 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,755 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:01:33,755 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 138662642, now seen corresponding path program 2 times [2021-12-21 15:01:33,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113575171] [2021-12-21 15:01:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:33,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113575171] [2021-12-21 15:01:33,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113575171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:33,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:33,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:33,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990932219] [2021-12-21 15:01:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:33,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:33,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:33,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2021-12-21 15:01:33,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:33,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2021-12-21 15:01:33,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:33,984 INFO L129 PetriNetUnfolder]: 98/516 cut-off events. [2021-12-21 15:01:33,984 INFO L130 PetriNetUnfolder]: For 69/73 co-relation queries the response was YES. [2021-12-21 15:01:33,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 516 events. 98/516 cut-off events. For 69/73 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2846 event pairs, 9 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 909. Up to 84 conditions per place. [2021-12-21 15:01:33,986 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 23 selfloop transitions, 1 changer transitions 13/127 dead transitions. [2021-12-21 15:01:33,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 419 flow [2021-12-21 15:01:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:01:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:01:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2021-12-21 15:01:33,988 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2021-12-21 15:01:33,988 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2021-12-21 15:01:33,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2021-12-21 15:01:33,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:33,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2021-12-21 15:01:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,991 INFO L186 Difference]: Start difference. First operand has 123 places, 110 transitions, 289 flow. Second operand 7 states and 713 transitions. [2021-12-21 15:01:33,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 419 flow [2021-12-21 15:01:33,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 400 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:33,993 INFO L242 Difference]: Finished difference. Result has 126 places, 110 transitions, 289 flow [2021-12-21 15:01:33,993 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=126, PETRI_TRANSITIONS=110} [2021-12-21 15:01:33,994 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 1 predicate places. [2021-12-21 15:01:33,994 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 289 flow [2021-12-21 15:01:33,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:33,994 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:33,994 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:33,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:01:33,995 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash -230738318, now seen corresponding path program 3 times [2021-12-21 15:01:33,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467104356] [2021-12-21 15:01:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:33,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:34,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:34,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467104356] [2021-12-21 15:01:34,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467104356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:34,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:34,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-21 15:01:34,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689135193] [2021-12-21 15:01:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:34,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 15:01:34,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 15:01:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:01:34,289 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2021-12-21 15:01:34,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 289 flow. Second operand has 13 states, 13 states have (on average 92.84615384615384) internal successors, (1207), 13 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:34,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2021-12-21 15:01:34,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:34,605 INFO L129 PetriNetUnfolder]: 34/293 cut-off events. [2021-12-21 15:01:34,605 INFO L130 PetriNetUnfolder]: For 31/51 co-relation queries the response was YES. [2021-12-21 15:01:34,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 293 events. 34/293 cut-off events. For 31/51 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1187 event pairs, 0 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 480. Up to 30 conditions per place. [2021-12-21 15:01:34,607 INFO L132 encePairwiseOnDemand]: 106/120 looper letters, 16 selfloop transitions, 9 changer transitions 12/122 dead transitions. [2021-12-21 15:01:34,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 122 transitions, 407 flow [2021-12-21 15:01:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 15:01:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-21 15:01:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1583 transitions. [2021-12-21 15:01:34,610 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7759803921568628 [2021-12-21 15:01:34,610 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1583 transitions. [2021-12-21 15:01:34,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1583 transitions. [2021-12-21 15:01:34,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:34,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1583 transitions. [2021-12-21 15:01:34,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.11764705882354) internal successors, (1583), 17 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 120.0) internal successors, (2160), 18 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,616 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 120.0) internal successors, (2160), 18 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,616 INFO L186 Difference]: Start difference. First operand has 126 places, 110 transitions, 289 flow. Second operand 17 states and 1583 transitions. [2021-12-21 15:01:34,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 122 transitions, 407 flow [2021-12-21 15:01:34,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 122 transitions, 392 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:34,618 INFO L242 Difference]: Finished difference. Result has 140 places, 110 transitions, 320 flow [2021-12-21 15:01:34,618 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=320, PETRI_PLACES=140, PETRI_TRANSITIONS=110} [2021-12-21 15:01:34,619 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 15 predicate places. [2021-12-21 15:01:34,619 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 110 transitions, 320 flow [2021-12-21 15:01:34,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.84615384615384) internal successors, (1207), 13 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,620 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:34,620 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:34,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:01:34,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash -781652042, now seen corresponding path program 4 times [2021-12-21 15:01:34,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:34,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656781967] [2021-12-21 15:01:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:34,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:34,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:34,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656781967] [2021-12-21 15:01:34,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656781967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:34,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:34,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:01:34,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443071997] [2021-12-21 15:01:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:34,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:01:34,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:01:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:01:34,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2021-12-21 15:01:34,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 110 transitions, 320 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:34,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2021-12-21 15:01:34,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:34,889 INFO L129 PetriNetUnfolder]: 63/394 cut-off events. [2021-12-21 15:01:34,889 INFO L130 PetriNetUnfolder]: For 181/184 co-relation queries the response was YES. [2021-12-21 15:01:34,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 394 events. 63/394 cut-off events. For 181/184 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1964 event pairs, 9 based on Foata normal form. 3/391 useless extension candidates. Maximal degree in co-relation 801. Up to 65 conditions per place. [2021-12-21 15:01:34,891 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 19 selfloop transitions, 5 changer transitions 19/125 dead transitions. [2021-12-21 15:01:34,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 125 transitions, 484 flow [2021-12-21 15:01:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:01:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-21 15:01:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2021-12-21 15:01:34,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2021-12-21 15:01:34,893 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2021-12-21 15:01:34,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2021-12-21 15:01:34,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:34,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2021-12-21 15:01:34,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,896 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,897 INFO L186 Difference]: Start difference. First operand has 140 places, 110 transitions, 320 flow. Second operand 8 states and 770 transitions. [2021-12-21 15:01:34,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 125 transitions, 484 flow [2021-12-21 15:01:34,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 442 flow, removed 7 selfloop flow, removed 13 redundant places. [2021-12-21 15:01:34,899 INFO L242 Difference]: Finished difference. Result has 131 places, 106 transitions, 284 flow [2021-12-21 15:01:34,900 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=284, PETRI_PLACES=131, PETRI_TRANSITIONS=106} [2021-12-21 15:01:34,900 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 6 predicate places. [2021-12-21 15:01:34,900 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 106 transitions, 284 flow [2021-12-21 15:01:34,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:34,901 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:34,901 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:34,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:01:34,901 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1600332936, now seen corresponding path program 5 times [2021-12-21 15:01:34,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:34,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347796786] [2021-12-21 15:01:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:34,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:34,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:01:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:35,040 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:01:35,041 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:01:35,042 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-21 15:01:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-21 15:01:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-21 15:01:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-21 15:01:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-21 15:01:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-21 15:01:35,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:01:35,046 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:35,049 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:01:35,050 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:01:35,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:01:35 BasicIcfg [2021-12-21 15:01:35,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:01:35,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:01:35,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:01:35,185 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:01:35,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:30" (3/4) ... [2021-12-21 15:01:35,187 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:01:35,275 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:01:35,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:01:35,275 INFO L158 Benchmark]: Toolchain (without parser) took 6206.85ms. Allocated memory was 90.2MB in the beginning and 218.1MB in the end (delta: 127.9MB). Free memory was 60.3MB in the beginning and 97.1MB in the end (delta: -36.8MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,276 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:01:35,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.94ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 60.1MB in the beginning and 75.9MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.65ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 72.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,277 INFO L158 Benchmark]: Boogie Preprocessor took 64.91ms. Allocated memory is still 113.2MB. Free memory was 72.8MB in the beginning and 70.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,277 INFO L158 Benchmark]: RCFGBuilder took 984.55ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 64.0MB in the end (delta: 6.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,277 INFO L158 Benchmark]: TraceAbstraction took 4581.57ms. Allocated memory was 113.2MB in the beginning and 218.1MB in the end (delta: 104.9MB). Free memory was 63.2MB in the beginning and 141.1MB in the end (delta: -77.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,278 INFO L158 Benchmark]: Witness Printer took 90.62ms. Allocated memory is still 218.1MB. Free memory was 141.1MB in the beginning and 97.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2021-12-21 15:01:35,279 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 90.2MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.94ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 60.1MB in the beginning and 75.9MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.65ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 72.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.91ms. Allocated memory is still 113.2MB. Free memory was 72.8MB in the beginning and 70.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 984.55ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 64.0MB in the end (delta: 6.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4581.57ms. Allocated memory was 113.2MB in the beginning and 218.1MB in the end (delta: 104.9MB). Free memory was 63.2MB in the beginning and 141.1MB in the end (delta: -77.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 90.62ms. Allocated memory is still 218.1MB. Free memory was 141.1MB in the beginning and 97.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t260; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-2, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-1, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 148 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: 4.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 864 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1067 IncrementalHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 109 mSDtfsCounter, 1067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 954 NumberOfCodeBlocks, 954 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 850 ConstructedInterpolants, 0 QuantifiedInterpolants, 4463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 15:01:35,309 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