/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:44:41,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:44:41,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:44:41,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:44:41,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:44:41,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:44:41,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:44:41,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:44:41,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:44:41,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:44:41,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:44:41,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:44:41,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:44:41,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:44:41,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:44:41,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:44:41,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:44:41,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:44:41,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:44:41,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:44:41,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:44:41,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:44:41,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:44:41,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:44:41,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:44:41,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:44:41,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:44:41,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:44:41,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:44:41,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:44:41,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:44:41,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:44:41,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:44:41,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:44:41,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:44:41,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:44:41,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:44:41,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:44:41,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:44:41,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:44:41,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:44:41,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 21:44:41,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:44:41,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:44:41,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:44:41,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:44:41,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:44:41,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:44:41,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:44:41,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:44:41,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:44:41,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:44:41,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:44:41,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:44:41,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:44:41,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:44:41,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:44:41,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:44:41,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 21:44:41,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:44:41,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:44:41,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:44:41,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:44:41,547 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:44:41,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-10 21:44:41,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8760cc4/084e57d003414cc28de0c4e3bec16e62/FLAG6a93f6a13 [2022-02-10 21:44:41,984 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:44:41,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-10 21:44:41,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8760cc4/084e57d003414cc28de0c4e3bec16e62/FLAG6a93f6a13 [2022-02-10 21:44:42,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8760cc4/084e57d003414cc28de0c4e3bec16e62 [2022-02-10 21:44:42,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:44:42,017 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:44:42,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:44:42,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:44:42,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:44:42,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79fdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42, skipping insertion in model container [2022-02-10 21:44:42,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:44:42,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:44:42,243 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-10 21:44:42,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:44:42,388 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:44:42,396 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-10 21:44:42,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:44:42,493 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:44:42,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42 WrapperNode [2022-02-10 21:44:42,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:44:42,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:44:42,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:44:42,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:44:42,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,578 INFO L137 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 267 [2022-02-10 21:44:42,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:44:42,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:44:42,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:44:42,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:44:42,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:44:42,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:44:42,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:44:42,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:44:42,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (1/1) ... [2022-02-10 21:44:42,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:44:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:44:42,656 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-02-10 21:44:42,674 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-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:44:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:44:42,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:44:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:44:42,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:44:42,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:44:42,689 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:44:42,834 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:44:42,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:44:43,171 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:44:43,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:44:43,345 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:44:43,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:44:43 BoogieIcfgContainer [2022-02-10 21:44:43,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:44:43,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:44:43,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:44:43,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:44:43,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:44:42" (1/3) ... [2022-02-10 21:44:43,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc9ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:44:43, skipping insertion in model container [2022-02-10 21:44:43,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:44:42" (2/3) ... [2022-02-10 21:44:43,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc9ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:44:43, skipping insertion in model container [2022-02-10 21:44:43,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:44:43" (3/3) ... [2022-02-10 21:44:43,351 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-10 21:44:43,355 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:44:43,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:44:43,355 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:44:43,355 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,379 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,380 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,381 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,382 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,383 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,384 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,385 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,386 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,386 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,386 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,386 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,388 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,388 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,389 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,390 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,391 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,391 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:44:43,391 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:44:43,419 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:44:43,424 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:44:43,424 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-10 21:44:43,431 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 98 transitions, 206 flow [2022-02-10 21:44:43,497 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2033 states, 2030 states have (on average 2.7073891625615762) internal successors, (5496), 2032 states have internal predecessors, (5496), 0 states have call successors, (0), 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-02-10 21:44:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 2033 states, 2030 states have (on average 2.7073891625615762) internal successors, (5496), 2032 states have internal predecessors, (5496), 0 states have call successors, (0), 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-02-10 21:44:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 21:44:43,509 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:43,509 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:43,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1181332090, now seen corresponding path program 1 times [2022-02-10 21:44:43,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:43,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013126731] [2022-02-10 21:44:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:43,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:43,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013126731] [2022-02-10 21:44:43,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013126731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:43,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:43,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:44:43,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546365861] [2022-02-10 21:44:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:43,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:44:43,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:44:43,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:44:43,876 INFO L87 Difference]: Start difference. First operand has 2033 states, 2030 states have (on average 2.7073891625615762) internal successors, (5496), 2032 states have internal predecessors, (5496), 0 states have call successors, (0), 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 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-02-10 21:44:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:43,958 INFO L93 Difference]: Finished difference Result 1777 states and 4664 transitions. [2022-02-10 21:44:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:44:43,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-10 21:44:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:43,976 INFO L225 Difference]: With dead ends: 1777 [2022-02-10 21:44:43,977 INFO L226 Difference]: Without dead ends: 1537 [2022-02-10 21:44:43,978 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-10 21:44:43,980 INFO L934 BasicCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:43,982 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:44:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-02-10 21:44:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1537. [2022-02-10 21:44:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 2.64453125) internal successors, (4062), 1536 states have internal predecessors, (4062), 0 states have call successors, (0), 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-02-10 21:44:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 4062 transitions. [2022-02-10 21:44:44,085 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 4062 transitions. Word has length 50 [2022-02-10 21:44:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:44,086 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 4062 transitions. [2022-02-10 21:44:44,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-02-10 21:44:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 4062 transitions. [2022-02-10 21:44:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-10 21:44:44,094 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:44,094 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:44,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:44:44,095 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:44,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1123567931, now seen corresponding path program 1 times [2022-02-10 21:44:44,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:44,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727203301] [2022-02-10 21:44:44,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:44,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:44,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727203301] [2022-02-10 21:44:44,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727203301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:44,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:44,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:44:44,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647968386] [2022-02-10 21:44:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:44,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:44:44,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:44:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:44:44,290 INFO L87 Difference]: Start difference. First operand 1537 states and 4062 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-10 21:44:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:44,451 INFO L93 Difference]: Finished difference Result 1713 states and 4480 transitions. [2022-02-10 21:44:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:44:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-10 21:44:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:44,457 INFO L225 Difference]: With dead ends: 1713 [2022-02-10 21:44:44,458 INFO L226 Difference]: Without dead ends: 1313 [2022-02-10 21:44:44,460 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:44:44,461 INFO L934 BasicCegarLoop]: 111 mSDtfsCounter, 92 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:44,462 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 430 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-02-10 21:44:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2022-02-10 21:44:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 2.605182926829268) internal successors, (3418), 1312 states have internal predecessors, (3418), 0 states have call successors, (0), 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-02-10 21:44:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 3418 transitions. [2022-02-10 21:44:44,490 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 3418 transitions. Word has length 65 [2022-02-10 21:44:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:44,491 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 3418 transitions. [2022-02-10 21:44:44,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-10 21:44:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 3418 transitions. [2022-02-10 21:44:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-10 21:44:44,493 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:44,494 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:44,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:44:44,494 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 860954106, now seen corresponding path program 1 times [2022-02-10 21:44:44,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:44,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656255748] [2022-02-10 21:44:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:44,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:44,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656255748] [2022-02-10 21:44:44,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656255748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:44,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:44,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:44:44,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976545085] [2022-02-10 21:44:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:44,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:44:44,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:44:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:44:44,806 INFO L87 Difference]: Start difference. First operand 1313 states and 3418 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-10 21:44:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:44,993 INFO L93 Difference]: Finished difference Result 1511 states and 3900 transitions. [2022-02-10 21:44:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 21:44:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-10 21:44:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:44,999 INFO L225 Difference]: With dead ends: 1511 [2022-02-10 21:44:44,999 INFO L226 Difference]: Without dead ends: 1271 [2022-02-10 21:44:45,000 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-02-10 21:44:45,004 INFO L934 BasicCegarLoop]: 102 mSDtfsCounter, 211 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:45,005 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 480 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-02-10 21:44:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2022-02-10 21:44:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.5921259842519686) internal successors, (3292), 1270 states have internal predecessors, (3292), 0 states have call successors, (0), 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-02-10 21:44:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3292 transitions. [2022-02-10 21:44:45,049 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3292 transitions. Word has length 69 [2022-02-10 21:44:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:45,050 INFO L470 AbstractCegarLoop]: Abstraction has 1271 states and 3292 transitions. [2022-02-10 21:44:45,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-10 21:44:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3292 transitions. [2022-02-10 21:44:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 21:44:45,058 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:45,058 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:45,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:44:45,059 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -534828005, now seen corresponding path program 1 times [2022-02-10 21:44:45,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:45,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105364595] [2022-02-10 21:44:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:45,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:45,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105364595] [2022-02-10 21:44:45,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105364595] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:45,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:45,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:44:45,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052053943] [2022-02-10 21:44:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:45,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:44:45,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:44:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:44:45,184 INFO L87 Difference]: Start difference. First operand 1271 states and 3292 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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-02-10 21:44:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:45,308 INFO L93 Difference]: Finished difference Result 1328 states and 3328 transitions. [2022-02-10 21:44:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:44:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-10 21:44:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:45,312 INFO L225 Difference]: With dead ends: 1328 [2022-02-10 21:44:45,312 INFO L226 Difference]: Without dead ends: 928 [2022-02-10 21:44:45,312 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:44:45,313 INFO L934 BasicCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:45,313 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 332 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-02-10 21:44:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2022-02-10 21:44:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 2.441208198489752) internal successors, (2263), 927 states have internal predecessors, (2263), 0 states have call successors, (0), 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-02-10 21:44:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2263 transitions. [2022-02-10 21:44:45,329 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2263 transitions. Word has length 71 [2022-02-10 21:44:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:45,330 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 2263 transitions. [2022-02-10 21:44:45,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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-02-10 21:44:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2263 transitions. [2022-02-10 21:44:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-10 21:44:45,332 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:45,332 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:45,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:44:45,332 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1954132348, now seen corresponding path program 1 times [2022-02-10 21:44:45,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:45,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749348060] [2022-02-10 21:44:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:45,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:45,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749348060] [2022-02-10 21:44:45,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749348060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:45,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:45,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:44:45,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138679033] [2022-02-10 21:44:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:45,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:44:45,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:44:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:44:45,455 INFO L87 Difference]: Start difference. First operand 928 states and 2263 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-10 21:44:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:45,567 INFO L93 Difference]: Finished difference Result 697 states and 1623 transitions. [2022-02-10 21:44:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:44:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-10 21:44:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:45,571 INFO L225 Difference]: With dead ends: 697 [2022-02-10 21:44:45,571 INFO L226 Difference]: Without dead ends: 472 [2022-02-10 21:44:45,571 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:44:45,573 INFO L934 BasicCegarLoop]: 91 mSDtfsCounter, 202 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:45,573 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 339 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:45,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-10 21:44:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-02-10 21:44:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.2229299363057327) internal successors, (1047), 471 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:44:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1047 transitions. [2022-02-10 21:44:45,583 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1047 transitions. Word has length 72 [2022-02-10 21:44:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:45,584 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1047 transitions. [2022-02-10 21:44:45,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-10 21:44:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1047 transitions. [2022-02-10 21:44:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:44:45,585 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:45,585 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:45,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:44:45,585 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1766006773, now seen corresponding path program 1 times [2022-02-10 21:44:45,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:45,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282904065] [2022-02-10 21:44:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:45,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:45,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282904065] [2022-02-10 21:44:45,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282904065] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:45,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:45,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:44:45,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321069880] [2022-02-10 21:44:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:45,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:44:45,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:44:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:44:45,796 INFO L87 Difference]: Start difference. First operand 472 states and 1047 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-10 21:44:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:45,976 INFO L93 Difference]: Finished difference Result 871 states and 1988 transitions. [2022-02-10 21:44:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:44:45,976 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-10 21:44:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:45,978 INFO L225 Difference]: With dead ends: 871 [2022-02-10 21:44:45,978 INFO L226 Difference]: Without dead ends: 394 [2022-02-10 21:44:45,978 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-10 21:44:45,978 INFO L934 BasicCegarLoop]: 115 mSDtfsCounter, 181 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:45,979 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 860 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-10 21:44:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-02-10 21:44:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.2061068702290076) internal successors, (867), 393 states have internal predecessors, (867), 0 states have call successors, (0), 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-02-10 21:44:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 867 transitions. [2022-02-10 21:44:45,988 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 867 transitions. Word has length 77 [2022-02-10 21:44:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:45,988 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 867 transitions. [2022-02-10 21:44:45,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-10 21:44:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 867 transitions. [2022-02-10 21:44:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:44:45,989 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:45,989 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:45,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:44:45,990 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2088477025, now seen corresponding path program 2 times [2022-02-10 21:44:45,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:45,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884249630] [2022-02-10 21:44:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:44:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:44:46,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:44:46,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884249630] [2022-02-10 21:44:46,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884249630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:44:46,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:44:46,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:44:46,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672885007] [2022-02-10 21:44:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:44:46,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:44:46,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:44:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:44:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:44:46,192 INFO L87 Difference]: Start difference. First operand 394 states and 867 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-10 21:44:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:44:46,304 INFO L93 Difference]: Finished difference Result 571 states and 1273 transitions. [2022-02-10 21:44:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:44:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-10 21:44:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:44:46,306 INFO L225 Difference]: With dead ends: 571 [2022-02-10 21:44:46,306 INFO L226 Difference]: Without dead ends: 358 [2022-02-10 21:44:46,307 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:44:46,307 INFO L934 BasicCegarLoop]: 95 mSDtfsCounter, 197 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:44:46,307 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 563 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:44:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-10 21:44:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2022-02-10 21:44:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.1596638655462184) internal successors, (771), 357 states have internal predecessors, (771), 0 states have call successors, (0), 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-02-10 21:44:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 771 transitions. [2022-02-10 21:44:46,313 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 771 transitions. Word has length 77 [2022-02-10 21:44:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:44:46,314 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 771 transitions. [2022-02-10 21:44:46,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-10 21:44:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 771 transitions. [2022-02-10 21:44:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:44:46,315 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:44:46,315 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:44:46,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:44:46,315 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:44:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:44:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1187440383, now seen corresponding path program 3 times [2022-02-10 21:44:46,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:44:46,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241989179] [2022-02-10 21:44:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:44:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:44:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:44:46,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:44:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:44:46,395 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:44:46,395 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:44:46,396 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-10 21:44:46,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-10 21:44:46,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-10 21:44:46,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-02-10 21:44:46,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-10 21:44:46,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:44:46,399 INFO L733 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-02-10 21:44:46,403 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:44:46,403 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:44:46,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:44:46 BasicIcfg [2022-02-10 21:44:46,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:44:46,473 INFO L158 Benchmark]: Toolchain (without parser) took 4455.42ms. Allocated memory was 213.9MB in the beginning and 277.9MB in the end (delta: 64.0MB). Free memory was 161.9MB in the beginning and 151.2MB in the end (delta: 10.8MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,473 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 180.3MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:44:46,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.35ms. Allocated memory is still 213.9MB. Free memory was 161.7MB in the beginning and 176.8MB in the end (delta: -15.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.20ms. Allocated memory is still 213.9MB. Free memory was 176.8MB in the beginning and 174.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,473 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 213.9MB. Free memory was 174.2MB in the beginning and 171.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,473 INFO L158 Benchmark]: RCFGBuilder took 735.71ms. Allocated memory is still 213.9MB. Free memory was 171.8MB in the beginning and 102.3MB in the end (delta: 69.5MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,474 INFO L158 Benchmark]: TraceAbstraction took 3124.92ms. Allocated memory was 213.9MB in the beginning and 277.9MB in the end (delta: 64.0MB). Free memory was 101.8MB in the beginning and 151.2MB in the end (delta: -49.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-02-10 21:44:46,475 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.11ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 180.3MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.35ms. Allocated memory is still 213.9MB. Free memory was 161.7MB in the beginning and 176.8MB in the end (delta: -15.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.20ms. Allocated memory is still 213.9MB. Free memory was 176.8MB in the beginning and 174.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 213.9MB. Free memory was 174.2MB in the beginning and 171.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 735.71ms. Allocated memory is still 213.9MB. Free memory was 171.8MB in the beginning and 102.3MB in the end (delta: 69.5MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3124.92ms. Allocated memory was 213.9MB in the beginning and 277.9MB in the end (delta: 64.0MB). Free memory was 101.8MB in the beginning and 151.2MB in the end (delta: -49.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=54, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 805]: 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: 803]: 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 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1056 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 3143 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2605 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 690 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2033occurred in iteration=0, InterpolantAutomatonStates: 67, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-02-10 21:44:46,504 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...