/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/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 10:49:12,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 10:49:12,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 10:49:12,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 10:49:12,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 10:49:12,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 10:49:12,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 10:49:12,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 10:49:12,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 10:49:12,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 10:49:12,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 10:49:12,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 10:49:12,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 10:49:12,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 10:49:12,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 10:49:12,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 10:49:12,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 10:49:12,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 10:49:12,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 10:49:12,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 10:49:12,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 10:49:12,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 10:49:12,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 10:49:12,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 10:49:12,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 10:49:12,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 10:49:12,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 10:49:12,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 10:49:12,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 10:49:12,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 10:49:12,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 10:49:12,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 10:49:12,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 10:49:12,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 10:49:12,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 10:49:12,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 10:49:12,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 10:49:12,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 10:49:12,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 10:49:12,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 10:49:12,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 10:49:12,254 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-15 10:49:12,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 10:49:12,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 10:49:12,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 10:49:12,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 10:49:12,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 10:49:12,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 10:49:12,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 10:49:12,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 10:49:12,279 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 10:49:12,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 10:49:12,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 10:49:12,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 10:49:12,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 10:49:12,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:49:12,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 10:49:12,282 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 10:49:12,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 10:49:12,283 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-15 10:49:12,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 10:49:12,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 10:49:12,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 10:49:12,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 10:49:12,511 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 10:49:12,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-02-15 10:49:12,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0158786b/37f76b6f1f864efdac91908a20fcfda1/FLAGfa5f01f37 [2022-02-15 10:49:12,991 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 10:49:12,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-02-15 10:49:13,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0158786b/37f76b6f1f864efdac91908a20fcfda1/FLAGfa5f01f37 [2022-02-15 10:49:13,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0158786b/37f76b6f1f864efdac91908a20fcfda1 [2022-02-15 10:49:13,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 10:49:13,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 10:49:13,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 10:49:13,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 10:49:13,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 10:49:13,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d7d97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13, skipping insertion in model container [2022-02-15 10:49:13,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 10:49:13,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 10:49:13,239 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/safe011_power.opt_pso.opt.i[959,972] [2022-02-15 10:49:13,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:49:13,407 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 10:49:13,415 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/safe011_power.opt_pso.opt.i[959,972] [2022-02-15 10:49:13,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:49:13,469 INFO L208 MainTranslator]: Completed translation [2022-02-15 10:49:13,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13 WrapperNode [2022-02-15 10:49:13,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 10:49:13,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 10:49:13,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 10:49:13,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 10:49:13,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,519 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-02-15 10:49:13,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 10:49:13,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 10:49:13,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 10:49:13,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 10:49:13,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 10:49:13,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 10:49:13,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 10:49:13,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 10:49:13,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (1/1) ... [2022-02-15 10:49:13,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:49:13,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:49:13,608 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-15 10:49:13,613 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-15 10:49:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 10:49:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-15 10:49:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 10:49:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 10:49:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 10:49:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-15 10:49:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-15 10:49:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-15 10:49:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-15 10:49:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-15 10:49:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-15 10:49:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 10:49:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-15 10:49:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 10:49:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 10:49:13,637 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 10:49:13,805 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 10:49:13,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 10:49:14,231 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 10:49:14,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 10:49:14,455 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-15 10:49:14,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:14 BoogieIcfgContainer [2022-02-15 10:49:14,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 10:49:14,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 10:49:14,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 10:49:14,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 10:49:14,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:49:13" (1/3) ... [2022-02-15 10:49:14,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c252452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:14, skipping insertion in model container [2022-02-15 10:49:14,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:13" (2/3) ... [2022-02-15 10:49:14,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c252452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:14, skipping insertion in model container [2022-02-15 10:49:14,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:14" (3/3) ... [2022-02-15 10:49:14,463 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-02-15 10:49:14,467 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 10:49:14,467 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 10:49:14,467 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-15 10:49:14,467 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,497 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,500 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,500 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,501 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,501 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,501 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,501 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,504 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,506 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,507 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,508 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,509 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,509 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,509 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,509 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,509 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,510 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,510 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,510 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,510 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,512 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,513 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,513 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,515 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,518 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,519 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,519 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,520 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:49:14,522 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-15 10:49:14,556 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 10:49:14,561 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, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 10:49:14,562 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-15 10:49:14,570 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 114 transitions, 243 flow [2022-02-15 10:49:14,982 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 0 states have call successors, (0), 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-15 10:49:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 0 states have call successors, (0), 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-15 10:49:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 10:49:15,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:15,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:15,028 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -401119588, now seen corresponding path program 1 times [2022-02-15 10:49:15,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:15,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473736554] [2022-02-15 10:49:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:15,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:15,345 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-15 10:49:15,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:15,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473736554] [2022-02-15 10:49:15,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473736554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:15,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:15,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-15 10:49:15,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295336598] [2022-02-15 10:49:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:15,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 10:49:15,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 10:49:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 10:49:15,400 INFO L87 Difference]: Start difference. First operand has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 0 states have call successors, (0), 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.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-15 10:49:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:15,622 INFO L93 Difference]: Finished difference Result 11810 states and 41123 transitions. [2022-02-15 10:49:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 10:49:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-15 10:49:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:15,700 INFO L225 Difference]: With dead ends: 11810 [2022-02-15 10:49:15,701 INFO L226 Difference]: Without dead ends: 9762 [2022-02-15 10:49:15,702 INFO L932 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-15 10:49:15,704 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 47 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:15,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 162 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 10:49:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9762 states. [2022-02-15 10:49:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9762 to 9762. [2022-02-15 10:49:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9761 states have (on average 3.5114230099375066) internal successors, (34275), 9761 states have internal predecessors, (34275), 0 states have call successors, (0), 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-15 10:49:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 34275 transitions. [2022-02-15 10:49:16,168 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 34275 transitions. Word has length 51 [2022-02-15 10:49:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:16,170 INFO L470 AbstractCegarLoop]: Abstraction has 9762 states and 34275 transitions. [2022-02-15 10:49:16,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-15 10:49:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 34275 transitions. [2022-02-15 10:49:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-15 10:49:16,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:16,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:16,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 10:49:16,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -824296931, now seen corresponding path program 1 times [2022-02-15 10:49:16,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:16,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365285765] [2022-02-15 10:49:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:16,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:16,357 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-15 10:49:16,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:16,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365285765] [2022-02-15 10:49:16,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365285765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:16,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:16,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 10:49:16,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561457579] [2022-02-15 10:49:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:16,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 10:49:16,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 10:49:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 10:49:16,361 INFO L87 Difference]: Start difference. First operand 9762 states and 34275 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-15 10:49:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:16,699 INFO L93 Difference]: Finished difference Result 11426 states and 39811 transitions. [2022-02-15 10:49:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 10:49:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-15 10:49:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:16,741 INFO L225 Difference]: With dead ends: 11426 [2022-02-15 10:49:16,741 INFO L226 Difference]: Without dead ends: 8866 [2022-02-15 10:49:16,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-15 10:49:16,742 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 133 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:16,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 518 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2022-02-15 10:49:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8866. [2022-02-15 10:49:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 8865 states have (on average 3.487309644670051) internal successors, (30915), 8865 states have internal predecessors, (30915), 0 states have call successors, (0), 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-15 10:49:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 30915 transitions. [2022-02-15 10:49:17,002 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 30915 transitions. Word has length 73 [2022-02-15 10:49:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:17,003 INFO L470 AbstractCegarLoop]: Abstraction has 8866 states and 30915 transitions. [2022-02-15 10:49:17,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-15 10:49:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 30915 transitions. [2022-02-15 10:49:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 10:49:17,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:17,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:17,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 10:49:17,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1896888094, now seen corresponding path program 1 times [2022-02-15 10:49:17,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:17,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823007988] [2022-02-15 10:49:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:17,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:17,136 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-15 10:49:17,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:17,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823007988] [2022-02-15 10:49:17,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823007988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:17,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:17,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 10:49:17,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225404043] [2022-02-15 10:49:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:17,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 10:49:17,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 10:49:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 10:49:17,138 INFO L87 Difference]: Start difference. First operand 8866 states and 30915 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-15 10:49:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:17,418 INFO L93 Difference]: Finished difference Result 10674 states and 36993 transitions. [2022-02-15 10:49:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 10:49:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-15 10:49:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:17,454 INFO L225 Difference]: With dead ends: 10674 [2022-02-15 10:49:17,454 INFO L226 Difference]: Without dead ends: 8754 [2022-02-15 10:49:17,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-15 10:49:17,459 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:17,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 533 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8754 states. [2022-02-15 10:49:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8754 to 8754. [2022-02-15 10:49:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8754 states, 8753 states have (on average 3.482348908945504) internal successors, (30481), 8753 states have internal predecessors, (30481), 0 states have call successors, (0), 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-15 10:49:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 30481 transitions. [2022-02-15 10:49:17,738 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 30481 transitions. Word has length 75 [2022-02-15 10:49:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:17,738 INFO L470 AbstractCegarLoop]: Abstraction has 8754 states and 30481 transitions. [2022-02-15 10:49:17,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-15 10:49:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 30481 transitions. [2022-02-15 10:49:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 10:49:17,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:17,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:17,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 10:49:17,753 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -154412490, now seen corresponding path program 1 times [2022-02-15 10:49:17,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:17,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294771799] [2022-02-15 10:49:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:17,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:17,919 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-15 10:49:17,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:17,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294771799] [2022-02-15 10:49:17,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294771799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:17,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:17,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 10:49:17,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43566823] [2022-02-15 10:49:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:17,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 10:49:17,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 10:49:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 10:49:17,921 INFO L87 Difference]: Start difference. First operand 8754 states and 30481 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-15 10:49:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:18,158 INFO L93 Difference]: Finished difference Result 12268 states and 42503 transitions. [2022-02-15 10:49:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 10:49:18,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-15 10:49:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:18,181 INFO L225 Difference]: With dead ends: 12268 [2022-02-15 10:49:18,181 INFO L226 Difference]: Without dead ends: 6204 [2022-02-15 10:49:18,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-15 10:49:18,182 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 225 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:18,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 562 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2022-02-15 10:49:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6204. [2022-02-15 10:49:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6204 states, 6203 states have (on average 3.3720780267612445) internal successors, (20917), 6203 states have internal predecessors, (20917), 0 states have call successors, (0), 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-15 10:49:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 20917 transitions. [2022-02-15 10:49:18,393 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 20917 transitions. Word has length 76 [2022-02-15 10:49:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:18,394 INFO L470 AbstractCegarLoop]: Abstraction has 6204 states and 20917 transitions. [2022-02-15 10:49:18,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-15 10:49:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 20917 transitions. [2022-02-15 10:49:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 10:49:18,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:18,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:18,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 10:49:18,405 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -856904741, now seen corresponding path program 1 times [2022-02-15 10:49:18,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:18,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115773575] [2022-02-15 10:49:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:18,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:18,542 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-15 10:49:18,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:18,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115773575] [2022-02-15 10:49:18,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115773575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:18,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:18,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 10:49:18,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25675020] [2022-02-15 10:49:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:18,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 10:49:18,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 10:49:18,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 10:49:18,544 INFO L87 Difference]: Start difference. First operand 6204 states and 20917 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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-15 10:49:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:18,733 INFO L93 Difference]: Finished difference Result 10304 states and 34527 transitions. [2022-02-15 10:49:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 10:49:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-15 10:49:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:18,754 INFO L225 Difference]: With dead ends: 10304 [2022-02-15 10:49:18,754 INFO L226 Difference]: Without dead ends: 6904 [2022-02-15 10:49:18,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-15 10:49:18,755 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 118 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:18,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 599 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2022-02-15 10:49:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 5854. [2022-02-15 10:49:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 5853 states have (on average 3.3020673159063727) internal successors, (19327), 5853 states have internal predecessors, (19327), 0 states have call successors, (0), 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-15 10:49:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 19327 transitions. [2022-02-15 10:49:18,877 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 19327 transitions. Word has length 79 [2022-02-15 10:49:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:18,877 INFO L470 AbstractCegarLoop]: Abstraction has 5854 states and 19327 transitions. [2022-02-15 10:49:18,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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-15 10:49:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 19327 transitions. [2022-02-15 10:49:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-15 10:49:18,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:18,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:18,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 10:49:18,888 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash -960045702, now seen corresponding path program 1 times [2022-02-15 10:49:18,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:18,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449463654] [2022-02-15 10:49:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:18,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:19,084 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-15 10:49:19,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:19,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449463654] [2022-02-15 10:49:19,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449463654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:19,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:19,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 10:49:19,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093311013] [2022-02-15 10:49:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:19,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 10:49:19,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 10:49:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-15 10:49:19,085 INFO L87 Difference]: Start difference. First operand 5854 states and 19327 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-15 10:49:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:19,381 INFO L93 Difference]: Finished difference Result 6740 states and 22213 transitions. [2022-02-15 10:49:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 10:49:19,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-15 10:49:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:19,401 INFO L225 Difference]: With dead ends: 6740 [2022-02-15 10:49:19,401 INFO L226 Difference]: Without dead ends: 5840 [2022-02-15 10:49:19,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:49:19,403 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 224 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:19,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 766 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2022-02-15 10:49:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5840. [2022-02-15 10:49:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5840 states, 5839 states have (on average 3.3003939030655935) internal successors, (19271), 5839 states have internal predecessors, (19271), 0 states have call successors, (0), 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-15 10:49:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5840 states to 5840 states and 19271 transitions. [2022-02-15 10:49:19,530 INFO L78 Accepts]: Start accepts. Automaton has 5840 states and 19271 transitions. Word has length 80 [2022-02-15 10:49:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:19,530 INFO L470 AbstractCegarLoop]: Abstraction has 5840 states and 19271 transitions. [2022-02-15 10:49:19,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-15 10:49:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5840 states and 19271 transitions. [2022-02-15 10:49:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-15 10:49:19,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:19,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:19,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 10:49:19,548 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1813950147, now seen corresponding path program 1 times [2022-02-15 10:49:19,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:19,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216499560] [2022-02-15 10:49:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:19,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:19,755 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-15 10:49:19,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:19,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216499560] [2022-02-15 10:49:19,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216499560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:19,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:19,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 10:49:19,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724186647] [2022-02-15 10:49:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:19,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 10:49:19,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 10:49:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-15 10:49:19,757 INFO L87 Difference]: Start difference. First operand 5840 states and 19271 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:20,003 INFO L93 Difference]: Finished difference Result 6663 states and 21942 transitions. [2022-02-15 10:49:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 10:49:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-15 10:49:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:20,022 INFO L225 Difference]: With dead ends: 6663 [2022-02-15 10:49:20,022 INFO L226 Difference]: Without dead ends: 5913 [2022-02-15 10:49:20,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-02-15 10:49:20,023 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 188 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:20,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 855 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2022-02-15 10:49:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 5913. [2022-02-15 10:49:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5912 states have (on average 3.301082543978349) internal successors, (19516), 5912 states have internal predecessors, (19516), 0 states have call successors, (0), 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-15 10:49:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 19516 transitions. [2022-02-15 10:49:20,231 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 19516 transitions. Word has length 81 [2022-02-15 10:49:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:20,231 INFO L470 AbstractCegarLoop]: Abstraction has 5913 states and 19516 transitions. [2022-02-15 10:49:20,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 19516 transitions. [2022-02-15 10:49:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-15 10:49:20,241 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:20,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:20,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 10:49:20,241 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1280465149, now seen corresponding path program 2 times [2022-02-15 10:49:20,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:20,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677150646] [2022-02-15 10:49:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:20,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:20,411 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-15 10:49:20,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:20,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677150646] [2022-02-15 10:49:20,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677150646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:20,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:20,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 10:49:20,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418920916] [2022-02-15 10:49:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:20,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 10:49:20,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 10:49:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-15 10:49:20,413 INFO L87 Difference]: Start difference. First operand 5913 states and 19516 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:20,691 INFO L93 Difference]: Finished difference Result 6668 states and 21955 transitions. [2022-02-15 10:49:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 10:49:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-15 10:49:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:20,709 INFO L225 Difference]: With dead ends: 6668 [2022-02-15 10:49:20,709 INFO L226 Difference]: Without dead ends: 5918 [2022-02-15 10:49:20,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:49:20,710 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 288 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:20,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 969 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2022-02-15 10:49:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 5909. [2022-02-15 10:49:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5909 states, 5908 states have (on average 3.301624915368991) internal successors, (19506), 5908 states have internal predecessors, (19506), 0 states have call successors, (0), 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-15 10:49:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 19506 transitions. [2022-02-15 10:49:20,826 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 19506 transitions. Word has length 81 [2022-02-15 10:49:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:20,826 INFO L470 AbstractCegarLoop]: Abstraction has 5909 states and 19506 transitions. [2022-02-15 10:49:20,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 19506 transitions. [2022-02-15 10:49:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-15 10:49:20,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:20,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:20,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 10:49:20,836 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash -709754658, now seen corresponding path program 1 times [2022-02-15 10:49:20,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:20,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425465119] [2022-02-15 10:49:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:20,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:20,929 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-15 10:49:20,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:20,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425465119] [2022-02-15 10:49:20,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425465119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:20,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:20,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 10:49:20,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386743269] [2022-02-15 10:49:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:20,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 10:49:20,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 10:49:20,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 10:49:20,931 INFO L87 Difference]: Start difference. First operand 5909 states and 19506 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:21,093 INFO L93 Difference]: Finished difference Result 6982 states and 22664 transitions. [2022-02-15 10:49:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 10:49:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-15 10:49:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:21,108 INFO L225 Difference]: With dead ends: 6982 [2022-02-15 10:49:21,108 INFO L226 Difference]: Without dead ends: 5117 [2022-02-15 10:49:21,109 INFO L932 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-15 10:49:21,110 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 178 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:21,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 393 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2022-02-15 10:49:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5088. [2022-02-15 10:49:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5088 states, 5087 states have (on average 3.229998034204836) internal successors, (16431), 5087 states have internal predecessors, (16431), 0 states have call successors, (0), 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-15 10:49:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5088 states to 5088 states and 16431 transitions. [2022-02-15 10:49:21,243 INFO L78 Accepts]: Start accepts. Automaton has 5088 states and 16431 transitions. Word has length 81 [2022-02-15 10:49:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:21,244 INFO L470 AbstractCegarLoop]: Abstraction has 5088 states and 16431 transitions. [2022-02-15 10:49:21,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 10:49:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5088 states and 16431 transitions. [2022-02-15 10:49:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-15 10:49:21,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:21,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:21,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 10:49:21,256 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1509647079, now seen corresponding path program 1 times [2022-02-15 10:49:21,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:21,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354522741] [2022-02-15 10:49:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:21,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:21,337 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-15 10:49:21,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:21,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354522741] [2022-02-15 10:49:21,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354522741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:21,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:21,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 10:49:21,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186049954] [2022-02-15 10:49:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:21,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 10:49:21,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 10:49:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-15 10:49:21,339 INFO L87 Difference]: Start difference. First operand 5088 states and 16431 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-15 10:49:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:21,504 INFO L93 Difference]: Finished difference Result 4863 states and 15228 transitions. [2022-02-15 10:49:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 10:49:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-15 10:49:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:21,512 INFO L225 Difference]: With dead ends: 4863 [2022-02-15 10:49:21,513 INFO L226 Difference]: Without dead ends: 3423 [2022-02-15 10:49:21,513 INFO L932 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-15 10:49:21,513 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 290 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:21,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 435 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2022-02-15 10:49:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3423. [2022-02-15 10:49:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3422 states have (on average 3.0736411455289305) internal successors, (10518), 3422 states have internal predecessors, (10518), 0 states have call successors, (0), 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-15 10:49:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 10518 transitions. [2022-02-15 10:49:21,581 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 10518 transitions. Word has length 82 [2022-02-15 10:49:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:21,582 INFO L470 AbstractCegarLoop]: Abstraction has 3423 states and 10518 transitions. [2022-02-15 10:49:21,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-15 10:49:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 10518 transitions. [2022-02-15 10:49:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-15 10:49:21,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:21,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:21,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 10:49:21,589 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1625940357, now seen corresponding path program 1 times [2022-02-15 10:49:21,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:21,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694506894] [2022-02-15 10:49:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:21,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:21,700 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-15 10:49:21,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:21,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694506894] [2022-02-15 10:49:21,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694506894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:21,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:21,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 10:49:21,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471059449] [2022-02-15 10:49:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:21,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 10:49:21,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:21,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 10:49:21,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-15 10:49:21,702 INFO L87 Difference]: Start difference. First operand 3423 states and 10518 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-15 10:49:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:21,845 INFO L93 Difference]: Finished difference Result 2730 states and 8163 transitions. [2022-02-15 10:49:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 10:49:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2022-02-15 10:49:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:21,849 INFO L225 Difference]: With dead ends: 2730 [2022-02-15 10:49:21,849 INFO L226 Difference]: Without dead ends: 1299 [2022-02-15 10:49:21,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-02-15 10:49:21,850 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 363 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:21,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 408 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2022-02-15 10:49:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2022-02-15 10:49:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 2.921417565485362) internal successors, (3792), 1298 states have internal predecessors, (3792), 0 states have call successors, (0), 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-15 10:49:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 3792 transitions. [2022-02-15 10:49:21,872 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 3792 transitions. Word has length 85 [2022-02-15 10:49:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:21,872 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 3792 transitions. [2022-02-15 10:49:21,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-15 10:49:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 3792 transitions. [2022-02-15 10:49:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 10:49:21,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:21,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:21,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 10:49:21,875 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1506870868, now seen corresponding path program 1 times [2022-02-15 10:49:21,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:21,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117975194] [2022-02-15 10:49:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:21,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:49:22,240 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-15 10:49:22,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:49:22,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117975194] [2022-02-15 10:49:22,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117975194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:49:22,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:49:22,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 10:49:22,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374692797] [2022-02-15 10:49:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:49:22,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 10:49:22,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:49:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 10:49:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-15 10:49:22,241 INFO L87 Difference]: Start difference. First operand 1299 states and 3792 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 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-15 10:49:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:49:22,446 INFO L93 Difference]: Finished difference Result 1950 states and 5750 transitions. [2022-02-15 10:49:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 10:49:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-02-15 10:49:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:49:22,449 INFO L225 Difference]: With dead ends: 1950 [2022-02-15 10:49:22,449 INFO L226 Difference]: Without dead ends: 991 [2022-02-15 10:49:22,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:49:22,449 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 241 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:49:22,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 1140 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:49:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-02-15 10:49:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2022-02-15 10:49:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 2.8282828282828283) internal successors, (2800), 990 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:49:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2800 transitions. [2022-02-15 10:49:22,464 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2800 transitions. Word has length 88 [2022-02-15 10:49:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:49:22,464 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 2800 transitions. [2022-02-15 10:49:22,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 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-15 10:49:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2800 transitions. [2022-02-15 10:49:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 10:49:22,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:49:22,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 10:49:22,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 10:49:22,466 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-15 10:49:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:49:22,467 INFO L85 PathProgramCache]: Analyzing trace with hash 841679700, now seen corresponding path program 2 times [2022-02-15 10:49:22,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:49:22,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415008693] [2022-02-15 10:49:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:49:22,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:49:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 10:49:22,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-15 10:49:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 10:49:22,561 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-15 10:49:22,561 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-15 10:49:22,562 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-15 10:49:22,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-15 10:49:22,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-15 10:49:22,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-15 10:49:22,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-15 10:49:22,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-15 10:49:22,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 10:49:22,565 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:49:22,568 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-15 10:49:22,568 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 10:49:22,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:49:22 BasicIcfg [2022-02-15 10:49:22,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 10:49:22,646 INFO L158 Benchmark]: Toolchain (without parser) took 9627.52ms. Allocated memory was 192.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 135.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 870.2MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.34ms. Allocated memory was 192.9MB in the beginning and 293.6MB in the end (delta: 100.7MB). Free memory was 135.4MB in the beginning and 252.4MB in the end (delta: -117.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 293.6MB. Free memory was 252.4MB in the beginning and 249.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 293.6MB. Free memory was 249.2MB in the beginning and 247.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: RCFGBuilder took 897.91ms. Allocated memory is still 293.6MB. Free memory was 247.1MB in the beginning and 169.0MB in the end (delta: 78.1MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,647 INFO L158 Benchmark]: TraceAbstraction took 8187.33ms. Allocated memory was 293.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 168.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 803.1MB. Max. memory is 8.0GB. [2022-02-15 10:49:22,648 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.34ms. Allocated memory was 192.9MB in the beginning and 293.6MB in the end (delta: 100.7MB). Free memory was 135.4MB in the beginning and 252.4MB in the end (delta: -117.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 293.6MB. Free memory was 252.4MB in the beginning and 249.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 293.6MB. Free memory was 249.2MB in the beginning and 247.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 897.91ms. Allocated memory is still 293.6MB. Free memory was 247.1MB in the beginning and 169.0MB in the end (delta: 78.1MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8187.33ms. Allocated memory was 293.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 168.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 803.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-2, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=-1, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - 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: 819]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2403 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2403 mSDsluCounter, 7340 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6334 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 1504 mSDtfsCounter, 1428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14042occurred in iteration=0, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 4832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-15 10:49:22,697 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...