/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:49:59,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:49:59,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:49:59,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:49:59,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:49:59,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:49:59,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:49:59,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:49:59,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:49:59,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:49:59,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:49:59,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:49:59,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:49:59,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:49:59,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:49:59,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:49:59,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:49:59,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:49:59,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:49:59,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:49:59,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:49:59,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:49:59,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:49:59,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:49:59,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:49:59,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:49:59,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:49:59,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:49:59,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:49:59,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:49:59,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:49:59,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:49:59,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:49:59,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:49:59,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:49:59,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:49:59,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:49:59,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:49:59,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:49:59,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:49:59,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:49:59,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:49:59,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:49:59,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:49:59,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:49:59,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:49:59,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:49:59,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:49:59,690 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:49:59,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:49:59,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:49:59,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:49:59,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:49:59,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:49:59,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:49:59,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:49:59,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:49:59,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:49:59,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:49:59,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:49:59,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:49:59,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:49:59,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:49:59,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:49:59,695 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 17:49:59,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:49:59,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:49:59,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:49:59,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:49:59,906 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:49:59,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:49:59,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624ad9f65/aa1c2a6c45384ef78b90beff906ce064/FLAG17f4a3734 [2022-03-15 17:50:00,328 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:50:00,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:50:00,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624ad9f65/aa1c2a6c45384ef78b90beff906ce064/FLAG17f4a3734 [2022-03-15 17:50:00,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624ad9f65/aa1c2a6c45384ef78b90beff906ce064 [2022-03-15 17:50:00,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:50:00,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:50:00,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:50:00,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:50:00,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:50:00,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:50:00" (1/1) ... [2022-03-15 17:50:00,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27664424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:00, skipping insertion in model container [2022-03-15 17:50:00,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:50:00" (1/1) ... [2022-03-15 17:50:00,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:50:00,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:50:00,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:50:00,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:50:00,990 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:50:00,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:50:01,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:50:01,043 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:50:01,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01 WrapperNode [2022-03-15 17:50:01,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:50:01,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:50:01,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:50:01,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:50:01,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,078 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-03-15 17:50:01,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:50:01,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:50:01,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:50:01,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:50:01,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:50:01,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:50:01,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:50:01,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:50:01,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (1/1) ... [2022-03-15 17:50:01,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:50:01,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:50:01,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:50:01,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:50:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:50:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:50:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:50:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:50:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:50:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:50:01,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:50:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:50:01,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:50:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:50:01,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:50:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:50:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:50:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:50:01,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:50:01,170 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:50:01,310 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:50:01,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:50:01,754 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:50:02,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:50:02,016 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:50:02,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:50:02 BoogieIcfgContainer [2022-03-15 17:50:02,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:50:02,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:50:02,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:50:02,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:50:02,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:50:00" (1/3) ... [2022-03-15 17:50:02,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c967cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:50:02, skipping insertion in model container [2022-03-15 17:50:02,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:50:01" (2/3) ... [2022-03-15 17:50:02,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c967cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:50:02, skipping insertion in model container [2022-03-15 17:50:02,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:50:02" (3/3) ... [2022-03-15 17:50:02,024 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:50:02,027 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:50:02,027 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:50:02,027 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:50:02,027 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:50:02,065 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,065 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,066 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,067 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,067 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,067 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,068 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,069 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,069 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,069 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,072 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,073 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,074 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,076 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,077 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,079 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,079 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,085 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,086 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,086 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,086 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,086 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,086 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,087 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,087 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,087 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,087 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,088 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,088 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,088 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,088 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,088 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,092 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,092 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,092 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,092 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,092 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,093 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,094 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,098 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,098 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,098 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,099 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,099 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,104 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,105 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,106 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,106 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,106 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,106 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,108 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,109 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,109 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:50:02,111 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:50:02,193 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:50:02,197 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:50:02,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:50:02,208 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:50:02,214 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 257 flow [2022-03-15 17:50:02,216 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 257 flow [2022-03-15 17:50:02,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-03-15 17:50:02,261 INFO L129 PetriNetUnfolder]: 2/118 cut-off events. [2022-03-15 17:50:02,261 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:50:02,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-03-15 17:50:02,267 INFO L116 LiptonReduction]: Number of co-enabled transitions 2416 [2022-03-15 17:50:04,917 INFO L131 LiptonReduction]: Checked pairs total: 6718 [2022-03-15 17:50:04,917 INFO L133 LiptonReduction]: Total number of compositions: 104 [2022-03-15 17:50:04,923 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2022-03-15 17:50:04,973 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1022 states, 1019 states have (on average 3.2620215897939158) internal successors, (3324), 1021 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 1022 states, 1019 states have (on average 3.2620215897939158) internal successors, (3324), 1021 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 17:50:04,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:04,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 17:50:04,979 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1135615, now seen corresponding path program 1 times [2022-03-15 17:50:04,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:04,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041763462] [2022-03-15 17:50:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:05,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:05,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041763462] [2022-03-15 17:50:05,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041763462] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:05,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:05,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:50:05,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425098225] [2022-03-15 17:50:05,127 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:05,129 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:05,147 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 17:50:05,147 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:05,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:05,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:50:05,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:50:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:50:05,181 INFO L87 Difference]: Start difference. First operand has 1022 states, 1019 states have (on average 3.2620215897939158) internal successors, (3324), 1021 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:05,280 INFO L93 Difference]: Finished difference Result 828 states and 2590 transitions. [2022-03-15 17:50:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:50:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-03-15 17:50:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:05,300 INFO L225 Difference]: With dead ends: 828 [2022-03-15 17:50:05,300 INFO L226 Difference]: Without dead ends: 792 [2022-03-15 17:50:05,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:50:05,304 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:05,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-03-15 17:50:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2022-03-15 17:50:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.152970922882427) internal successors, (2494), 791 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2022-03-15 17:50:05,419 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 3 [2022-03-15 17:50:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:05,420 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2022-03-15 17:50:05,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2022-03-15 17:50:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:50:05,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:05,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:05,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:50:05,421 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1231946551, now seen corresponding path program 1 times [2022-03-15 17:50:05,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:05,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978897853] [2022-03-15 17:50:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:05,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:05,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978897853] [2022-03-15 17:50:05,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978897853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:05,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:05,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:50:05,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085200335] [2022-03-15 17:50:05,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:05,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:05,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 17:50:05,573 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:05,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:50:05,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:50:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:50:05,574 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:05,636 INFO L93 Difference]: Finished difference Result 1220 states and 3678 transitions. [2022-03-15 17:50:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:50:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 17:50:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:05,641 INFO L225 Difference]: With dead ends: 1220 [2022-03-15 17:50:05,641 INFO L226 Difference]: Without dead ends: 1139 [2022-03-15 17:50:05,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:50:05,642 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:05,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-03-15 17:50:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1037. [2022-03-15 17:50:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 3.0878378378378377) internal successors, (3199), 1036 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 3199 transitions. [2022-03-15 17:50:05,667 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 3199 transitions. Word has length 9 [2022-03-15 17:50:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:05,668 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 3199 transitions. [2022-03-15 17:50:05,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 3199 transitions. [2022-03-15 17:50:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:50:05,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:05,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:05,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:50:05,670 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2049164316, now seen corresponding path program 1 times [2022-03-15 17:50:05,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:05,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494196708] [2022-03-15 17:50:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:05,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:05,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494196708] [2022-03-15 17:50:05,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494196708] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:05,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:05,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:50:05,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807670902] [2022-03-15 17:50:05,763 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:05,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:05,764 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2022-03-15 17:50:05,764 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:05,912 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7892#(or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p1_EAX~0 1)))] [2022-03-15 17:50:05,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:50:05,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:05,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:50:05,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:50:05,913 INFO L87 Difference]: Start difference. First operand 1037 states and 3199 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:06,004 INFO L93 Difference]: Finished difference Result 1059 states and 3181 transitions. [2022-03-15 17:50:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:50:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 17:50:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:06,009 INFO L225 Difference]: With dead ends: 1059 [2022-03-15 17:50:06,009 INFO L226 Difference]: Without dead ends: 1059 [2022-03-15 17:50:06,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:50:06,011 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:06,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-03-15 17:50:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 891. [2022-03-15 17:50:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 3.0573033707865167) internal successors, (2721), 890 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2721 transitions. [2022-03-15 17:50:06,036 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2721 transitions. Word has length 10 [2022-03-15 17:50:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:06,036 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 2721 transitions. [2022-03-15 17:50:06,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2721 transitions. [2022-03-15 17:50:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:50:06,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:06,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:06,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:50:06,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1899402765, now seen corresponding path program 1 times [2022-03-15 17:50:06,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:06,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846462489] [2022-03-15 17:50:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:06,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:06,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846462489] [2022-03-15 17:50:06,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846462489] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:06,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:06,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:50:06,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241512470] [2022-03-15 17:50:06,088 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:06,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:06,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2022-03-15 17:50:06,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:06,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10739#(or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 10738#(or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))] [2022-03-15 17:50:06,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:50:06,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:50:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:50:06,283 INFO L87 Difference]: Start difference. First operand 891 states and 2721 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:06,405 INFO L93 Difference]: Finished difference Result 1007 states and 3016 transitions. [2022-03-15 17:50:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:50:06,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 17:50:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:06,409 INFO L225 Difference]: With dead ends: 1007 [2022-03-15 17:50:06,409 INFO L226 Difference]: Without dead ends: 1007 [2022-03-15 17:50:06,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:50:06,410 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:06,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 7 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-03-15 17:50:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 791. [2022-03-15 17:50:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 3.050632911392405) internal successors, (2410), 790 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2410 transitions. [2022-03-15 17:50:06,433 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 2410 transitions. Word has length 11 [2022-03-15 17:50:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:06,433 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 2410 transitions. [2022-03-15 17:50:06,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 2410 transitions. [2022-03-15 17:50:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:50:06,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:06,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:06,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:50:06,435 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -101657621, now seen corresponding path program 1 times [2022-03-15 17:50:06,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:06,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243021109] [2022-03-15 17:50:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:06,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:06,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243021109] [2022-03-15 17:50:06,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243021109] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:06,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:06,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:50:06,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545669777] [2022-03-15 17:50:06,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:06,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:06,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 69 transitions. [2022-03-15 17:50:06,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:06,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:06,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:50:06,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:50:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:50:06,716 INFO L87 Difference]: Start difference. First operand 791 states and 2410 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:06,812 INFO L93 Difference]: Finished difference Result 736 states and 1976 transitions. [2022-03-15 17:50:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:50:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 17:50:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:06,814 INFO L225 Difference]: With dead ends: 736 [2022-03-15 17:50:06,814 INFO L226 Difference]: Without dead ends: 523 [2022-03-15 17:50:06,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:50:06,815 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:06,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 15 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-15 17:50:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-03-15 17:50:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 2.578544061302682) internal successors, (1346), 522 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1346 transitions. [2022-03-15 17:50:06,824 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1346 transitions. Word has length 13 [2022-03-15 17:50:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:06,824 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 1346 transitions. [2022-03-15 17:50:06,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1346 transitions. [2022-03-15 17:50:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:50:06,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:06,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:06,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:50:06,825 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash -828702269, now seen corresponding path program 1 times [2022-03-15 17:50:06,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:06,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274740549] [2022-03-15 17:50:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:06,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:06,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274740549] [2022-03-15 17:50:06,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274740549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:06,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:06,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:50:06,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066218284] [2022-03-15 17:50:06,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:06,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:06,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 52 transitions. [2022-03-15 17:50:06,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:07,186 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:07,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:50:07,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:50:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:50:07,187 INFO L87 Difference]: Start difference. First operand 523 states and 1346 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:07,292 INFO L93 Difference]: Finished difference Result 429 states and 1030 transitions. [2022-03-15 17:50:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:50:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 17:50:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:07,294 INFO L225 Difference]: With dead ends: 429 [2022-03-15 17:50:07,294 INFO L226 Difference]: Without dead ends: 332 [2022-03-15 17:50:07,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:50:07,295 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:07,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-03-15 17:50:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 326. [2022-03-15 17:50:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.353846153846154) internal successors, (765), 325 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 765 transitions. [2022-03-15 17:50:07,302 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 765 transitions. Word has length 16 [2022-03-15 17:50:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:07,302 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 765 transitions. [2022-03-15 17:50:07,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 765 transitions. [2022-03-15 17:50:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:50:07,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:07,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:07,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:50:07,303 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1328811830, now seen corresponding path program 1 times [2022-03-15 17:50:07,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:07,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415964319] [2022-03-15 17:50:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:07,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:07,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415964319] [2022-03-15 17:50:07,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415964319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:07,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:07,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:50:07,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507930643] [2022-03-15 17:50:07,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:07,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:07,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 39 transitions. [2022-03-15 17:50:07,402 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:07,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:07,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:50:07,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:50:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:50:07,581 INFO L87 Difference]: Start difference. First operand 326 states and 765 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:07,680 INFO L93 Difference]: Finished difference Result 300 states and 712 transitions. [2022-03-15 17:50:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:50:07,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 17:50:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:07,682 INFO L225 Difference]: With dead ends: 300 [2022-03-15 17:50:07,682 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 17:50:07,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:50:07,683 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:07,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 17 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 17:50:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 237. [2022-03-15 17:50:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.419491525423729) internal successors, (571), 236 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 571 transitions. [2022-03-15 17:50:07,687 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 571 transitions. Word has length 19 [2022-03-15 17:50:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:07,687 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 571 transitions. [2022-03-15 17:50:07,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 571 transitions. [2022-03-15 17:50:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:50:07,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:07,688 INFO L514 BasicCegarLoop]: 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] [2022-03-15 17:50:07,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:50:07,688 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1156233874, now seen corresponding path program 1 times [2022-03-15 17:50:07,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:07,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379631336] [2022-03-15 17:50:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:07,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:07,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379631336] [2022-03-15 17:50:07,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379631336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:07,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:07,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:50:07,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406871707] [2022-03-15 17:50:07,765 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:07,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:07,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 146 transitions. [2022-03-15 17:50:07,786 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:08,248 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:50:08,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:50:08,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:50:08,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:50:08,249 INFO L87 Difference]: Start difference. First operand 237 states and 571 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:08,336 INFO L93 Difference]: Finished difference Result 359 states and 854 transitions. [2022-03-15 17:50:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:50:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 17:50:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:08,337 INFO L225 Difference]: With dead ends: 359 [2022-03-15 17:50:08,337 INFO L226 Difference]: Without dead ends: 175 [2022-03-15 17:50:08,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:50:08,338 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:08,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:50:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-03-15 17:50:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-03-15 17:50:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 2.2701149425287355) internal successors, (395), 174 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 395 transitions. [2022-03-15 17:50:08,341 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 395 transitions. Word has length 23 [2022-03-15 17:50:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:08,341 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 395 transitions. [2022-03-15 17:50:08,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 395 transitions. [2022-03-15 17:50:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:50:08,342 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:08,342 INFO L514 BasicCegarLoop]: 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] [2022-03-15 17:50:08,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:50:08,342 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -878208356, now seen corresponding path program 2 times [2022-03-15 17:50:08,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:08,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99688121] [2022-03-15 17:50:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:50:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:50:08,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:50:08,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99688121] [2022-03-15 17:50:08,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99688121] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:50:08,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:50:08,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:50:08,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53434476] [2022-03-15 17:50:08,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:50:08,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:50:08,562 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 133 transitions. [2022-03-15 17:50:08,562 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:50:09,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17708#(and (or (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= ~a~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0)))), 17707#(and (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= ~a~0 ~a$w_buff0~0)) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a~0 0) (= (mod ~a$w_buff1_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1))] [2022-03-15 17:50:09,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:50:09,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:50:09,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:50:09,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:50:09,632 INFO L87 Difference]: Start difference. First operand 175 states and 395 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:50:09,924 INFO L93 Difference]: Finished difference Result 272 states and 603 transitions. [2022-03-15 17:50:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 17:50:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 17:50:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:50:09,926 INFO L225 Difference]: With dead ends: 272 [2022-03-15 17:50:09,926 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 17:50:09,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:50:09,926 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:50:09,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 26 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:50:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 17:50:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2022-03-15 17:50:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 2.2011494252873565) internal successors, (383), 174 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 383 transitions. [2022-03-15 17:50:09,930 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 383 transitions. Word has length 23 [2022-03-15 17:50:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:50:09,930 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 383 transitions. [2022-03-15 17:50:09,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:50:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 383 transitions. [2022-03-15 17:50:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:50:09,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:50:09,930 INFO L514 BasicCegarLoop]: 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] [2022-03-15 17:50:09,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:50:09,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:50:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:50:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash -734487258, now seen corresponding path program 3 times [2022-03-15 17:50:09,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:50:09,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866998688] [2022-03-15 17:50:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:50:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:50:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:50:09,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:50:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:50:10,033 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:50:10,033 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:50:10,034 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:50:10,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-15 17:50:10,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:50:10,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 17:50:10,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 17:50:10,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:50:10,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:50:10,037 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:50:10,040 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:50:10,040 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:50:10,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:50:10 BasicIcfg [2022-03-15 17:50:10,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:50:10,085 INFO L158 Benchmark]: Toolchain (without parser) took 9397.05ms. Allocated memory was 209.7MB in the beginning and 425.7MB in the end (delta: 216.0MB). Free memory was 157.2MB in the beginning and 353.2MB in the end (delta: -196.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 17:50:10,085 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:50:10,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.55ms. Allocated memory is still 209.7MB. Free memory was 157.1MB in the beginning and 172.2MB in the end (delta: -15.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-03-15 17:50:10,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.93ms. Allocated memory is still 209.7MB. Free memory was 171.7MB in the beginning and 169.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:50:10,086 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 209.7MB. Free memory was 169.6MB in the beginning and 167.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:50:10,086 INFO L158 Benchmark]: RCFGBuilder took 916.18ms. Allocated memory is still 209.7MB. Free memory was 167.0MB in the beginning and 89.9MB in the end (delta: 77.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-03-15 17:50:10,086 INFO L158 Benchmark]: TraceAbstraction took 8065.57ms. Allocated memory was 209.7MB in the beginning and 425.7MB in the end (delta: 216.0MB). Free memory was 89.4MB in the beginning and 353.2MB in the end (delta: -263.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:50:10,087 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.09ms. Allocated memory is still 209.7MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.55ms. Allocated memory is still 209.7MB. Free memory was 157.1MB in the beginning and 172.2MB in the end (delta: -15.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.93ms. Allocated memory is still 209.7MB. Free memory was 171.7MB in the beginning and 169.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 209.7MB. Free memory was 169.6MB in the beginning and 167.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 916.18ms. Allocated memory is still 209.7MB. Free memory was 167.0MB in the beginning and 89.9MB in the end (delta: 77.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8065.57ms. Allocated memory was 209.7MB in the beginning and 425.7MB in the end (delta: 216.0MB). Free memory was 89.4MB in the beginning and 353.2MB in the end (delta: -263.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 129 PlacesBefore, 38 PlacesAfterwards, 121 TransitionsBefore, 29 TransitionsAfterwards, 2416 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 6718 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3178, positive: 2962, positive conditional: 0, positive unconditional: 2962, negative: 216, negative conditional: 0, negative unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1318, positive: 1273, positive conditional: 0, positive unconditional: 1273, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3178, positive: 1689, positive conditional: 0, positive unconditional: 1689, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 1318, unknown conditional: 0, unknown unconditional: 1318] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 814 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 43 mSDtfsCounter, 814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=2, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 572 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-15 17:50:10,142 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...