/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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-08 23:59:03,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-08 23:59:03,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-08 23:59:03,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-08 23:59:03,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-08 23:59:03,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-08 23:59:03,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-08 23:59:03,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-08 23:59:03,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-08 23:59:03,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-08 23:59:03,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-08 23:59:03,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-08 23:59:03,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-08 23:59:03,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-08 23:59:03,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-08 23:59:03,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-08 23:59:03,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-08 23:59:03,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-08 23:59:03,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-08 23:59:03,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-08 23:59:03,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-08 23:59:03,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-08 23:59:03,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-08 23:59:03,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-08 23:59:03,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-08 23:59:03,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-08 23:59:03,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-08 23:59:03,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-08 23:59:03,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-08 23:59:03,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-08 23:59:03,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-08 23:59:03,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-08 23:59:03,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-08 23:59:03,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-08 23:59:03,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-08 23:59:03,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-08 23:59:03,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-08 23:59:03,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-08 23:59:03,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-08 23:59:03,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-08 23:59:03,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-08 23:59:03,981 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-08 23:59:04,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-08 23:59:04,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-08 23:59:04,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-08 23:59:04,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-08 23:59:04,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-08 23:59:04,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-08 23:59:04,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Use SBE=true [2022-02-08 23:59:04,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-08 23:59:04,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-08 23:59:04,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-08 23:59:04,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-08 23:59:04,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-08 23:59:04,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-08 23:59:04,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-08 23:59:04,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-08 23:59:04,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-08 23:59:04,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-08 23:59:04,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:59:04,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-08 23:59:04,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-08 23:59:04,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-08 23:59:04,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-08 23:59:04,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-08 23:59:04,011 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-08 23:59:04,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-08 23:59:04,011 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-08 23:59:04,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-08 23:59:04,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-08 23:59:04,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-08 23:59:04,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-08 23:59:04,215 INFO L275 PluginConnector]: CDTParser initialized [2022-02-08 23:59:04,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:59:04,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c222959/493bfed534dc4ef5ac68ab276c415304/FLAG1bbf04fa7 [2022-02-08 23:59:04,676 INFO L306 CDTParser]: Found 1 translation units. [2022-02-08 23:59:04,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:59:04,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c222959/493bfed534dc4ef5ac68ab276c415304/FLAG1bbf04fa7 [2022-02-08 23:59:05,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c222959/493bfed534dc4ef5ac68ab276c415304 [2022-02-08 23:59:05,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-08 23:59:05,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-08 23:59:05,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-08 23:59:05,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-08 23:59:05,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-08 23:59:05,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e27688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05, skipping insertion in model container [2022-02-08 23:59:05,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-08 23:59:05,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-08 23:59:05,238 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-02-08 23:59:05,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:59:05,393 INFO L203 MainTranslator]: Completed pre-run [2022-02-08 23:59:05,403 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-02-08 23:59:05,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:59:05,471 INFO L208 MainTranslator]: Completed translation [2022-02-08 23:59:05,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05 WrapperNode [2022-02-08 23:59:05,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-08 23:59:05,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-08 23:59:05,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-08 23:59:05,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-08 23:59:05,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,508 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-02-08 23:59:05,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-08 23:59:05,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-08 23:59:05,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-08 23:59:05,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-08 23:59:05,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-08 23:59:05,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-08 23:59:05,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-08 23:59:05,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-08 23:59:05,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (1/1) ... [2022-02-08 23:59:05,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:59:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-08 23:59:05,592 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-08 23:59:05,612 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-08 23:59:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-08 23:59:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-08 23:59:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-08 23:59:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-08 23:59:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-08 23:59:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-08 23:59:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-08 23:59:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-08 23:59:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-08 23:59:05,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-08 23:59:05,621 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-08 23:59:05,779 INFO L234 CfgBuilder]: Building ICFG [2022-02-08 23:59:05,780 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-08 23:59:06,391 INFO L275 CfgBuilder]: Performing block encoding [2022-02-08 23:59:06,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-08 23:59:06,779 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-08 23:59:06,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:59:06 BoogieIcfgContainer [2022-02-08 23:59:06,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-08 23:59:06,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-08 23:59:06,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-08 23:59:06,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-08 23:59:06,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:59:05" (1/3) ... [2022-02-08 23:59:06,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19097aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:59:06, skipping insertion in model container [2022-02-08 23:59:06,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:59:05" (2/3) ... [2022-02-08 23:59:06,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19097aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:59:06, skipping insertion in model container [2022-02-08 23:59:06,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:59:06" (3/3) ... [2022-02-08 23:59:06,787 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:59:06,793 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-08 23:59:06,793 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-08 23:59:06,793 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-08 23:59:06,793 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-08 23:59:06,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,844 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,850 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,850 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,850 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,850 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,860 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,860 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,861 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,866 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,884 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,884 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,885 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,886 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,886 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,889 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,890 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,891 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,899 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,900 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,901 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,902 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,905 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,906 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,909 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,909 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,909 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:59:06,909 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-08 23:59:06,950 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-08 23:59:06,963 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-08 23:59:06,963 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-08 23:59:06,973 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 114 transitions, 243 flow [2022-02-08 23:59:07,360 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13762 states, 13759 states have (on average 3.566901664365143) internal successors, (49077), 13761 states have internal predecessors, (49077), 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-08 23:59:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 13762 states, 13759 states have (on average 3.566901664365143) internal successors, (49077), 13761 states have internal predecessors, (49077), 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-08 23:59:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-08 23:59:07,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:07,408 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] [2022-02-08 23:59:07,409 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1547640948, now seen corresponding path program 1 times [2022-02-08 23:59:07,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:07,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129141175] [2022-02-08 23:59:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:07,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:07,679 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-08 23:59:07,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:07,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129141175] [2022-02-08 23:59:07,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129141175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:07,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:07,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-08 23:59:07,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764550377] [2022-02-08 23:59:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:07,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-08 23:59:07,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-08 23:59:07,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-08 23:59:07,726 INFO L87 Difference]: Start difference. First operand has 13762 states, 13759 states have (on average 3.566901664365143) internal successors, (49077), 13761 states have internal predecessors, (49077), 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 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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-08 23:59:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:07,942 INFO L93 Difference]: Finished difference Result 11620 states and 40423 transitions. [2022-02-08 23:59:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-08 23:59:07,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2022-02-08 23:59:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:08,011 INFO L225 Difference]: With dead ends: 11620 [2022-02-08 23:59:08,011 INFO L226 Difference]: Without dead ends: 9604 [2022-02-08 23:59:08,012 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-08 23:59:08,015 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:08,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-08 23:59:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2022-02-08 23:59:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 9604. [2022-02-08 23:59:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9604 states, 9603 states have (on average 3.508278662917838) internal successors, (33690), 9603 states have internal predecessors, (33690), 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-08 23:59:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 33690 transitions. [2022-02-08 23:59:08,501 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 33690 transitions. Word has length 58 [2022-02-08 23:59:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:08,502 INFO L470 AbstractCegarLoop]: Abstraction has 9604 states and 33690 transitions. [2022-02-08 23:59:08,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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-08 23:59:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 33690 transitions. [2022-02-08 23:59:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-08 23:59:08,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:08,517 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-08 23:59:08,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-08 23:59:08,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 84128766, now seen corresponding path program 1 times [2022-02-08 23:59:08,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:08,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522859240] [2022-02-08 23:59:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:08,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:59:08,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:08,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522859240] [2022-02-08 23:59:08,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522859240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:08,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:08,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:59:08,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907008929] [2022-02-08 23:59:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:08,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:59:08,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:59:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:59:08,765 INFO L87 Difference]: Start difference. First operand 9604 states and 33690 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-08 23:59:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:09,032 INFO L93 Difference]: Finished difference Result 10556 states and 36683 transitions. [2022-02-08 23:59:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:59:09,033 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-08 23:59:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:09,071 INFO L225 Difference]: With dead ends: 10556 [2022-02-08 23:59:09,071 INFO L226 Difference]: Without dead ends: 8036 [2022-02-08 23:59:09,071 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-08 23:59:09,072 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 131 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:09,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 497 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2022-02-08 23:59:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 8036. [2022-02-08 23:59:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8036 states, 8035 states have (on average 3.4645924082140636) internal successors, (27838), 8035 states have internal predecessors, (27838), 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-08 23:59:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 27838 transitions. [2022-02-08 23:59:09,340 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 27838 transitions. Word has length 73 [2022-02-08 23:59:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:09,340 INFO L470 AbstractCegarLoop]: Abstraction has 8036 states and 27838 transitions. [2022-02-08 23:59:09,341 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-08 23:59:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 27838 transitions. [2022-02-08 23:59:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-08 23:59:09,355 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:09,355 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] [2022-02-08 23:59:09,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-08 23:59:09,355 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 121031616, now seen corresponding path program 1 times [2022-02-08 23:59:09,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:09,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222313279] [2022-02-08 23:59:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:09,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:09,588 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-08 23:59:09,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:09,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222313279] [2022-02-08 23:59:09,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222313279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:09,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:09,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:59:09,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727098817] [2022-02-08 23:59:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:09,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:59:09,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:09,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:59:09,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:59:09,591 INFO L87 Difference]: Start difference. First operand 8036 states and 27838 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:59:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:09,830 INFO L93 Difference]: Finished difference Result 9226 states and 31735 transitions. [2022-02-08 23:59:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:59:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-08 23:59:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:09,858 INFO L225 Difference]: With dead ends: 9226 [2022-02-08 23:59:09,858 INFO L226 Difference]: Without dead ends: 7826 [2022-02-08 23:59:09,860 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-08 23:59:09,864 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 98 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:09,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 505 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2022-02-08 23:59:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7826. [2022-02-08 23:59:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7826 states, 7825 states have (on average 3.455591054313099) internal successors, (27040), 7825 states have internal predecessors, (27040), 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-08 23:59:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 27040 transitions. [2022-02-08 23:59:10,112 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 27040 transitions. Word has length 77 [2022-02-08 23:59:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:10,113 INFO L470 AbstractCegarLoop]: Abstraction has 7826 states and 27040 transitions. [2022-02-08 23:59:10,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:59:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 27040 transitions. [2022-02-08 23:59:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-08 23:59:10,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:10,131 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-08 23:59:10,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-08 23:59:10,131 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1496000257, now seen corresponding path program 1 times [2022-02-08 23:59:10,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:10,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615094994] [2022-02-08 23:59:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:10,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:10,462 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-08 23:59:10,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:10,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615094994] [2022-02-08 23:59:10,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615094994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:10,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:10,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-08 23:59:10,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639263880] [2022-02-08 23:59:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:10,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-08 23:59:10,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-08 23:59:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:59:10,464 INFO L87 Difference]: Start difference. First operand 7826 states and 27040 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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-08 23:59:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:10,819 INFO L93 Difference]: Finished difference Result 9768 states and 33446 transitions. [2022-02-08 23:59:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-08 23:59:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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-08 23:59:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:10,846 INFO L225 Difference]: With dead ends: 9768 [2022-02-08 23:59:10,846 INFO L226 Difference]: Without dead ends: 8568 [2022-02-08 23:59:10,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2022-02-08 23:59:10,847 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 391 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:10,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 659 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8568 states. [2022-02-08 23:59:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8568 to 8568. [2022-02-08 23:59:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8568 states, 8567 states have (on average 3.437726158515233) internal successors, (29451), 8567 states have internal predecessors, (29451), 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-08 23:59:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 29451 transitions. [2022-02-08 23:59:11,105 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 29451 transitions. Word has length 79 [2022-02-08 23:59:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:11,105 INFO L470 AbstractCegarLoop]: Abstraction has 8568 states and 29451 transitions. [2022-02-08 23:59:11,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 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-08 23:59:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 29451 transitions. [2022-02-08 23:59:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-08 23:59:11,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:11,123 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-08 23:59:11,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-08 23:59:11,123 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1127342914, now seen corresponding path program 1 times [2022-02-08 23:59:11,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:11,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983585997] [2022-02-08 23:59:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:11,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:11,325 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-08 23:59:11,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:11,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983585997] [2022-02-08 23:59:11,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983585997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:11,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:11,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-08 23:59:11,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935685576] [2022-02-08 23:59:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:11,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-08 23:59:11,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-08 23:59:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:59:11,327 INFO L87 Difference]: Start difference. First operand 8568 states and 29451 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-08 23:59:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:11,753 INFO L93 Difference]: Finished difference Result 13088 states and 44527 transitions. [2022-02-08 23:59:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:59:11,768 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-08 23:59:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:11,813 INFO L225 Difference]: With dead ends: 13088 [2022-02-08 23:59:11,813 INFO L226 Difference]: Without dead ends: 9404 [2022-02-08 23:59:11,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-02-08 23:59:11,827 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 287 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:11,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 704 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2022-02-08 23:59:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 8592. [2022-02-08 23:59:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8592 states, 8591 states have (on average 3.395879408683506) internal successors, (29174), 8591 states have internal predecessors, (29174), 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-08 23:59:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8592 states to 8592 states and 29174 transitions. [2022-02-08 23:59:12,217 INFO L78 Accepts]: Start accepts. Automaton has 8592 states and 29174 transitions. Word has length 80 [2022-02-08 23:59:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:12,217 INFO L470 AbstractCegarLoop]: Abstraction has 8592 states and 29174 transitions. [2022-02-08 23:59:12,217 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-08 23:59:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8592 states and 29174 transitions. [2022-02-08 23:59:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-08 23:59:12,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:12,263 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-08 23:59:12,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-08 23:59:12,264 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -6324256, now seen corresponding path program 2 times [2022-02-08 23:59:12,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:12,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458677999] [2022-02-08 23:59:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:12,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:12,728 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-08 23:59:12,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:12,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458677999] [2022-02-08 23:59:12,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458677999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:12,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:12,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-08 23:59:12,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530823588] [2022-02-08 23:59:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:12,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-08 23:59:12,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:12,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-08 23:59:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:59:12,730 INFO L87 Difference]: Start difference. First operand 8592 states and 29174 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 23:59:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:13,234 INFO L93 Difference]: Finished difference Result 11050 states and 37663 transitions. [2022-02-08 23:59:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-08 23:59:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 23:59:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:13,376 INFO L225 Difference]: With dead ends: 11050 [2022-02-08 23:59:13,377 INFO L226 Difference]: Without dead ends: 10050 [2022-02-08 23:59:13,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=504, Unknown=0, NotChecked=0, Total=756 [2022-02-08 23:59:13,377 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 423 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:13,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 989 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10050 states. [2022-02-08 23:59:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10050 to 8332. [2022-02-08 23:59:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8332 states, 8331 states have (on average 3.4214380026407394) internal successors, (28504), 8331 states have internal predecessors, (28504), 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-08 23:59:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 28504 transitions. [2022-02-08 23:59:13,548 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 28504 transitions. Word has length 80 [2022-02-08 23:59:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:13,548 INFO L470 AbstractCegarLoop]: Abstraction has 8332 states and 28504 transitions. [2022-02-08 23:59:13,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 23:59:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 28504 transitions. [2022-02-08 23:59:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-08 23:59:13,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:13,566 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-08 23:59:13,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-08 23:59:13,566 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -409390531, now seen corresponding path program 1 times [2022-02-08 23:59:13,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:13,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507549423] [2022-02-08 23:59:13,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:13,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:13,665 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-08 23:59:13,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:13,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507549423] [2022-02-08 23:59:13,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507549423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:13,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:13,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:59:13,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319095208] [2022-02-08 23:59:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:13,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:59:13,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:59:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:59:13,666 INFO L87 Difference]: Start difference. First operand 8332 states and 28504 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-08 23:59:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:13,965 INFO L93 Difference]: Finished difference Result 12373 states and 41658 transitions. [2022-02-08 23:59:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:59:13,966 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-08 23:59:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:13,983 INFO L225 Difference]: With dead ends: 12373 [2022-02-08 23:59:13,983 INFO L226 Difference]: Without dead ends: 7124 [2022-02-08 23:59:13,983 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-08 23:59:13,985 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:13,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 584 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2022-02-08 23:59:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6424. [2022-02-08 23:59:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6424 states, 6423 states have (on average 3.2933208780943484) internal successors, (21153), 6423 states have internal predecessors, (21153), 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-08 23:59:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6424 states to 6424 states and 21153 transitions. [2022-02-08 23:59:14,107 INFO L78 Accepts]: Start accepts. Automaton has 6424 states and 21153 transitions. Word has length 81 [2022-02-08 23:59:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:14,108 INFO L470 AbstractCegarLoop]: Abstraction has 6424 states and 21153 transitions. [2022-02-08 23:59:14,108 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-08 23:59:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6424 states and 21153 transitions. [2022-02-08 23:59:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-08 23:59:14,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:14,119 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-08 23:59:14,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-08 23:59:14,119 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash -842812704, now seen corresponding path program 1 times [2022-02-08 23:59:14,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:14,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723311618] [2022-02-08 23:59:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:14,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:14,438 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-08 23:59:14,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:14,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723311618] [2022-02-08 23:59:14,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723311618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:14,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:14,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-08 23:59:14,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097936689] [2022-02-08 23:59:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:14,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-08 23:59:14,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-08 23:59:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:59:14,440 INFO L87 Difference]: Start difference. First operand 6424 states and 21153 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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-08 23:59:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:14,918 INFO L93 Difference]: Finished difference Result 9290 states and 30501 transitions. [2022-02-08 23:59:14,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-08 23:59:14,919 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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-08 23:59:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:14,935 INFO L225 Difference]: With dead ends: 9290 [2022-02-08 23:59:14,935 INFO L226 Difference]: Without dead ends: 6985 [2022-02-08 23:59:14,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2022-02-08 23:59:14,936 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 362 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:14,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 1146 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-08 23:59:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2022-02-08 23:59:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 6809. [2022-02-08 23:59:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6809 states, 6808 states have (on average 3.295828437132785) internal successors, (22438), 6808 states have internal predecessors, (22438), 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-08 23:59:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 22438 transitions. [2022-02-08 23:59:15,084 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 22438 transitions. Word has length 82 [2022-02-08 23:59:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:15,084 INFO L470 AbstractCegarLoop]: Abstraction has 6809 states and 22438 transitions. [2022-02-08 23:59:15,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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-08 23:59:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 22438 transitions. [2022-02-08 23:59:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-08 23:59:15,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:15,096 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-08 23:59:15,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-08 23:59:15,096 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 641328202, now seen corresponding path program 2 times [2022-02-08 23:59:15,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:15,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857462] [2022-02-08 23:59:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:15,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:15,280 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-08 23:59:15,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:15,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857462] [2022-02-08 23:59:15,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:15,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:15,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:59:15,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485322980] [2022-02-08 23:59:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:15,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:59:15,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:59:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:59:15,281 INFO L87 Difference]: Start difference. First operand 6809 states and 22438 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-08 23:59:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:15,597 INFO L93 Difference]: Finished difference Result 10013 states and 32593 transitions. [2022-02-08 23:59:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-08 23:59:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-08 23:59:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:15,612 INFO L225 Difference]: With dead ends: 10013 [2022-02-08 23:59:15,612 INFO L226 Difference]: Without dead ends: 7401 [2022-02-08 23:59:15,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2022-02-08 23:59:15,613 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 221 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:15,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 738 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2022-02-08 23:59:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 5917. [2022-02-08 23:59:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5917 states, 5916 states have (on average 3.216024340770791) internal successors, (19026), 5916 states have internal predecessors, (19026), 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-08 23:59:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 19026 transitions. [2022-02-08 23:59:15,709 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 19026 transitions. Word has length 82 [2022-02-08 23:59:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:15,709 INFO L470 AbstractCegarLoop]: Abstraction has 5917 states and 19026 transitions. [2022-02-08 23:59:15,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-08 23:59:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 19026 transitions. [2022-02-08 23:59:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:15,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:15,718 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] [2022-02-08 23:59:15,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-08 23:59:15,718 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 953033269, now seen corresponding path program 1 times [2022-02-08 23:59:15,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:15,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983241601] [2022-02-08 23:59:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:15,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:15,905 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-08 23:59:15,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:15,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983241601] [2022-02-08 23:59:15,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983241601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:15,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:15,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-08 23:59:15,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234739371] [2022-02-08 23:59:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:15,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-08 23:59:15,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:15,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-08 23:59:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-08 23:59:15,906 INFO L87 Difference]: Start difference. First operand 5917 states and 19026 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-08 23:59:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:16,416 INFO L93 Difference]: Finished difference Result 8886 states and 28588 transitions. [2022-02-08 23:59:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-08 23:59:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:16,432 INFO L225 Difference]: With dead ends: 8886 [2022-02-08 23:59:16,432 INFO L226 Difference]: Without dead ends: 6339 [2022-02-08 23:59:16,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-02-08 23:59:16,434 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 348 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:16,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1101 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-08 23:59:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2022-02-08 23:59:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6166. [2022-02-08 23:59:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6166 states, 6165 states have (on average 3.227250608272506) internal successors, (19896), 6165 states have internal predecessors, (19896), 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-08 23:59:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 19896 transitions. [2022-02-08 23:59:16,722 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 19896 transitions. Word has length 83 [2022-02-08 23:59:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:16,722 INFO L470 AbstractCegarLoop]: Abstraction has 6166 states and 19896 transitions. [2022-02-08 23:59:16,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-08 23:59:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 19896 transitions. [2022-02-08 23:59:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:16,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:16,747 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] [2022-02-08 23:59:16,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-08 23:59:16,748 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1941475655, now seen corresponding path program 2 times [2022-02-08 23:59:16,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:16,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601077969] [2022-02-08 23:59:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:16,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:17,044 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-08 23:59:17,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:17,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601077969] [2022-02-08 23:59:17,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601077969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:17,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:17,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-08 23:59:17,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744132482] [2022-02-08 23:59:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:17,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-08 23:59:17,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:17,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-08 23:59:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:59:17,046 INFO L87 Difference]: Start difference. First operand 6166 states and 19896 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:59:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:17,437 INFO L93 Difference]: Finished difference Result 6666 states and 21447 transitions. [2022-02-08 23:59:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-08 23:59:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:17,452 INFO L225 Difference]: With dead ends: 6666 [2022-02-08 23:59:17,452 INFO L226 Difference]: Without dead ends: 6158 [2022-02-08 23:59:17,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-02-08 23:59:17,452 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 294 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:17,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 1036 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2022-02-08 23:59:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6158. [2022-02-08 23:59:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6158 states, 6157 states have (on average 3.2288452168263766) internal successors, (19880), 6157 states have internal predecessors, (19880), 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-08 23:59:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 19880 transitions. [2022-02-08 23:59:17,575 INFO L78 Accepts]: Start accepts. Automaton has 6158 states and 19880 transitions. Word has length 83 [2022-02-08 23:59:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:17,575 INFO L470 AbstractCegarLoop]: Abstraction has 6158 states and 19880 transitions. [2022-02-08 23:59:17,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:59:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6158 states and 19880 transitions. [2022-02-08 23:59:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:17,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:17,585 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] [2022-02-08 23:59:17,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-08 23:59:17,586 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1406443509, now seen corresponding path program 3 times [2022-02-08 23:59:17,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:17,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428683467] [2022-02-08 23:59:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:17,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:17,924 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-08 23:59:17,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:17,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428683467] [2022-02-08 23:59:17,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428683467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:17,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:17,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-08 23:59:17,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230133411] [2022-02-08 23:59:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:17,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-08 23:59:17,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-08 23:59:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:59:17,926 INFO L87 Difference]: Start difference. First operand 6158 states and 19880 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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-08 23:59:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:18,260 INFO L93 Difference]: Finished difference Result 7082 states and 22734 transitions. [2022-02-08 23:59:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-08 23:59:18,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:18,274 INFO L225 Difference]: With dead ends: 7082 [2022-02-08 23:59:18,275 INFO L226 Difference]: Without dead ends: 6359 [2022-02-08 23:59:18,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-02-08 23:59:18,275 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 311 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:18,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 1374 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6359 states. [2022-02-08 23:59:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6359 to 6124. [2022-02-08 23:59:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 3.233219010289074) internal successors, (19797), 6123 states have internal predecessors, (19797), 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-08 23:59:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 19797 transitions. [2022-02-08 23:59:18,397 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 19797 transitions. Word has length 83 [2022-02-08 23:59:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:18,397 INFO L470 AbstractCegarLoop]: Abstraction has 6124 states and 19797 transitions. [2022-02-08 23:59:18,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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-08 23:59:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 19797 transitions. [2022-02-08 23:59:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:18,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:18,407 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] [2022-02-08 23:59:18,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-08 23:59:18,408 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -616480071, now seen corresponding path program 4 times [2022-02-08 23:59:18,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:18,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219221240] [2022-02-08 23:59:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:18,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:18,671 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-08 23:59:18,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:18,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219221240] [2022-02-08 23:59:18,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219221240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:18,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:18,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-08 23:59:18,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656791575] [2022-02-08 23:59:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:18,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-08 23:59:18,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-08 23:59:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-02-08 23:59:18,673 INFO L87 Difference]: Start difference. First operand 6124 states and 19797 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 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-08 23:59:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:19,124 INFO L93 Difference]: Finished difference Result 9187 states and 29652 transitions. [2022-02-08 23:59:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-08 23:59:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:19,142 INFO L225 Difference]: With dead ends: 9187 [2022-02-08 23:59:19,142 INFO L226 Difference]: Without dead ends: 7006 [2022-02-08 23:59:19,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-02-08 23:59:19,143 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 381 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:19,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1337 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-08 23:59:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2022-02-08 23:59:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 5719. [2022-02-08 23:59:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 5718 states have (on average 3.2193074501573977) internal successors, (18408), 5718 states have internal predecessors, (18408), 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-08 23:59:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 18408 transitions. [2022-02-08 23:59:19,269 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 18408 transitions. Word has length 83 [2022-02-08 23:59:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:19,269 INFO L470 AbstractCegarLoop]: Abstraction has 5719 states and 18408 transitions. [2022-02-08 23:59:19,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 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-08 23:59:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 18408 transitions. [2022-02-08 23:59:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:19,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:19,278 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] [2022-02-08 23:59:19,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-08 23:59:19,278 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -915478807, now seen corresponding path program 5 times [2022-02-08 23:59:19,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:19,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060408260] [2022-02-08 23:59:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:19,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:19,528 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-08 23:59:19,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:19,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060408260] [2022-02-08 23:59:19,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060408260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:19,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:19,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-08 23:59:19,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575553561] [2022-02-08 23:59:19,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:19,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-08 23:59:19,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-08 23:59:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-02-08 23:59:19,530 INFO L87 Difference]: Start difference. First operand 5719 states and 18408 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:59:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:19,977 INFO L93 Difference]: Finished difference Result 8799 states and 28306 transitions. [2022-02-08 23:59:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-08 23:59:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:19,988 INFO L225 Difference]: With dead ends: 8799 [2022-02-08 23:59:19,988 INFO L226 Difference]: Without dead ends: 4671 [2022-02-08 23:59:19,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-02-08 23:59:19,989 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 352 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:19,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1220 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:59:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2022-02-08 23:59:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4281. [2022-02-08 23:59:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 3.1873831775700934) internal successors, (13642), 4280 states have internal predecessors, (13642), 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-08 23:59:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 13642 transitions. [2022-02-08 23:59:20,067 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 13642 transitions. Word has length 83 [2022-02-08 23:59:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:20,068 INFO L470 AbstractCegarLoop]: Abstraction has 4281 states and 13642 transitions. [2022-02-08 23:59:20,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:59:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 13642 transitions. [2022-02-08 23:59:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:59:20,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:20,074 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] [2022-02-08 23:59:20,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-08 23:59:20,074 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1635813130, now seen corresponding path program 1 times [2022-02-08 23:59:20,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:20,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943642833] [2022-02-08 23:59:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:20,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:20,151 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-08 23:59:20,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:20,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943642833] [2022-02-08 23:59:20,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943642833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:20,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:20,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:59:20,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463398030] [2022-02-08 23:59:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:20,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:59:20,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:59:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:59:20,152 INFO L87 Difference]: Start difference. First operand 4281 states and 13642 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-08 23:59:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:20,325 INFO L93 Difference]: Finished difference Result 5174 states and 16217 transitions. [2022-02-08 23:59:20,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:59:20,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 83 [2022-02-08 23:59:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:20,332 INFO L225 Difference]: With dead ends: 5174 [2022-02-08 23:59:20,332 INFO L226 Difference]: Without dead ends: 3629 [2022-02-08 23:59:20,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:59:20,333 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 173 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:20,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 368 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2022-02-08 23:59:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3629. [2022-02-08 23:59:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3628 states have (on average 3.125137816979052) internal successors, (11338), 3628 states have internal predecessors, (11338), 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-08 23:59:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 11338 transitions. [2022-02-08 23:59:20,395 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 11338 transitions. Word has length 83 [2022-02-08 23:59:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:20,395 INFO L470 AbstractCegarLoop]: Abstraction has 3629 states and 11338 transitions. [2022-02-08 23:59:20,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-08 23:59:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 11338 transitions. [2022-02-08 23:59:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-08 23:59:20,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:20,400 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] [2022-02-08 23:59:20,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-08 23:59:20,400 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 524410516, now seen corresponding path program 1 times [2022-02-08 23:59:20,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:20,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915837440] [2022-02-08 23:59:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:20,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:20,486 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-08 23:59:20,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:20,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915837440] [2022-02-08 23:59:20,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915837440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:20,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:20,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:59:20,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964935023] [2022-02-08 23:59:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:20,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:59:20,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:59:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:59:20,489 INFO L87 Difference]: Start difference. First operand 3629 states and 11338 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-08 23:59:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:20,667 INFO L93 Difference]: Finished difference Result 3632 states and 11106 transitions. [2022-02-08 23:59:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-08 23:59:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2022-02-08 23:59:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:20,672 INFO L225 Difference]: With dead ends: 3632 [2022-02-08 23:59:20,672 INFO L226 Difference]: Without dead ends: 2477 [2022-02-08 23:59:20,673 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-08 23:59:20,673 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 262 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:20,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 404 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2022-02-08 23:59:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2022-02-08 23:59:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2476 states have (on average 3.018578352180937) internal successors, (7474), 2476 states have internal predecessors, (7474), 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-08 23:59:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 7474 transitions. [2022-02-08 23:59:20,716 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 7474 transitions. Word has length 84 [2022-02-08 23:59:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:20,716 INFO L470 AbstractCegarLoop]: Abstraction has 2477 states and 7474 transitions. [2022-02-08 23:59:20,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-08 23:59:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 7474 transitions. [2022-02-08 23:59:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-08 23:59:20,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:20,720 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] [2022-02-08 23:59:20,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-08 23:59:20,720 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1688669707, now seen corresponding path program 1 times [2022-02-08 23:59:20,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:20,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164178639] [2022-02-08 23:59:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:20,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:20,846 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-08 23:59:20,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:20,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164178639] [2022-02-08 23:59:20,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164178639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:20,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:20,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-08 23:59:20,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432540535] [2022-02-08 23:59:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:20,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-08 23:59:20,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-08 23:59:20,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-08 23:59:20,848 INFO L87 Difference]: Start difference. First operand 2477 states and 7474 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-08 23:59:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:21,000 INFO L93 Difference]: Finished difference Result 2054 states and 6019 transitions. [2022-02-08 23:59:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-08 23:59:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 86 [2022-02-08 23:59:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:21,003 INFO L225 Difference]: With dead ends: 2054 [2022-02-08 23:59:21,003 INFO L226 Difference]: Without dead ends: 1206 [2022-02-08 23:59:21,003 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-08 23:59:21,003 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 323 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:21,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 385 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2022-02-08 23:59:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1122. [2022-02-08 23:59:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 2.823371989295272) internal successors, (3165), 1121 states have internal predecessors, (3165), 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-08 23:59:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 3165 transitions. [2022-02-08 23:59:21,016 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 3165 transitions. Word has length 86 [2022-02-08 23:59:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:21,016 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 3165 transitions. [2022-02-08 23:59:21,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-08 23:59:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 3165 transitions. [2022-02-08 23:59:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-08 23:59:21,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:21,018 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-08 23:59:21,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-08 23:59:21,018 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1677476908, now seen corresponding path program 1 times [2022-02-08 23:59:21,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:21,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489541130] [2022-02-08 23:59:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:21,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:21,176 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-08 23:59:21,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:21,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489541130] [2022-02-08 23:59:21,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489541130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:21,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:21,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:59:21,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52388327] [2022-02-08 23:59:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:21,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:59:21,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:59:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:59:21,177 INFO L87 Difference]: Start difference. First operand 1122 states and 3165 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-08 23:59:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:21,340 INFO L93 Difference]: Finished difference Result 1815 states and 5211 transitions. [2022-02-08 23:59:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-08 23:59:21,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-08 23:59:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:21,342 INFO L225 Difference]: With dead ends: 1815 [2022-02-08 23:59:21,342 INFO L226 Difference]: Without dead ends: 1147 [2022-02-08 23:59:21,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-08 23:59:21,343 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:21,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 747 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-02-08 23:59:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1096. [2022-02-08 23:59:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1095 states have (on average 2.8237442922374427) internal successors, (3092), 1095 states have internal predecessors, (3092), 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-08 23:59:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 3092 transitions. [2022-02-08 23:59:21,355 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 3092 transitions. Word has length 88 [2022-02-08 23:59:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:21,355 INFO L470 AbstractCegarLoop]: Abstraction has 1096 states and 3092 transitions. [2022-02-08 23:59:21,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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-08 23:59:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 3092 transitions. [2022-02-08 23:59:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-08 23:59:21,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:21,357 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-08 23:59:21,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-08 23:59:21,357 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -866175066, now seen corresponding path program 2 times [2022-02-08 23:59:21,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:21,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376016102] [2022-02-08 23:59:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:21,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:21,478 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-08 23:59:21,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:21,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376016102] [2022-02-08 23:59:21,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376016102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:21,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:21,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-08 23:59:21,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407294415] [2022-02-08 23:59:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:21,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-08 23:59:21,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-08 23:59:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-08 23:59:21,480 INFO L87 Difference]: Start difference. First operand 1096 states and 3092 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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-08 23:59:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:21,621 INFO L93 Difference]: Finished difference Result 1774 states and 5104 transitions. [2022-02-08 23:59:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:59:21,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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-08 23:59:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:21,623 INFO L225 Difference]: With dead ends: 1774 [2022-02-08 23:59:21,623 INFO L226 Difference]: Without dead ends: 1111 [2022-02-08 23:59:21,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-08 23:59:21,624 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 59 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:21,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 760 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-02-08 23:59:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-02-08 23:59:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 2.8216216216216217) internal successors, (3132), 1110 states have internal predecessors, (3132), 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-08 23:59:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3132 transitions. [2022-02-08 23:59:21,637 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3132 transitions. Word has length 88 [2022-02-08 23:59:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:21,638 INFO L470 AbstractCegarLoop]: Abstraction has 1111 states and 3132 transitions. [2022-02-08 23:59:21,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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-08 23:59:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3132 transitions. [2022-02-08 23:59:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-08 23:59:21,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:21,639 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-08 23:59:21,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-08 23:59:21,639 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1475761094, now seen corresponding path program 3 times [2022-02-08 23:59:21,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:21,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130350797] [2022-02-08 23:59:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:21,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:59:21,942 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-08 23:59:21,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:59:21,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130350797] [2022-02-08 23:59:21,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130350797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:59:21,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:59:21,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-08 23:59:21,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092045938] [2022-02-08 23:59:21,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:59:21,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-08 23:59:21,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:59:21,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-08 23:59:21,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-02-08 23:59:21,944 INFO L87 Difference]: Start difference. First operand 1111 states and 3132 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-08 23:59:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:59:22,227 INFO L93 Difference]: Finished difference Result 1855 states and 5338 transitions. [2022-02-08 23:59:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-08 23:59:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-08 23:59:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:59:22,229 INFO L225 Difference]: With dead ends: 1855 [2022-02-08 23:59:22,229 INFO L226 Difference]: Without dead ends: 1044 [2022-02-08 23:59:22,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2022-02-08 23:59:22,230 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 306 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:59:22,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 909 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:59:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-02-08 23:59:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2022-02-08 23:59:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 2.8245445829338447) internal successors, (2946), 1043 states have internal predecessors, (2946), 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-08 23:59:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2946 transitions. [2022-02-08 23:59:22,244 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2946 transitions. Word has length 88 [2022-02-08 23:59:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:59:22,244 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 2946 transitions. [2022-02-08 23:59:22,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 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-08 23:59:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2946 transitions. [2022-02-08 23:59:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-08 23:59:22,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:59:22,246 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-08 23:59:22,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-08 23:59:22,246 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:59:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:59:22,246 INFO L85 PathProgramCache]: Analyzing trace with hash -466022968, now seen corresponding path program 4 times [2022-02-08 23:59:22,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:59:22,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132798819] [2022-02-08 23:59:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:59:22,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:59:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:59:22,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-08 23:59:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:59:22,435 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-08 23:59:22,435 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-08 23:59:22,436 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-08 23:59:22,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-08 23:59:22,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-08 23:59:22,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-08 23:59:22,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-08 23:59:22,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-08 23:59:22,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-08 23:59:22,440 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:59:22,443 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-08 23:59:22,443 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-08 23:59:22,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:59:22 BasicIcfg [2022-02-08 23:59:22,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-08 23:59:22,583 INFO L158 Benchmark]: Toolchain (without parser) took 17528.02ms. Allocated memory was 200.3MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 171.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-02-08 23:59:22,583 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-08 23:59:22,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.52ms. Allocated memory is still 200.3MB. Free memory was 171.1MB in the beginning and 155.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-02-08 23:59:22,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 200.3MB. Free memory was 155.7MB in the beginning and 153.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-08 23:59:22,587 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 200.3MB. Free memory was 152.5MB in the beginning and 149.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-08 23:59:22,587 INFO L158 Benchmark]: RCFGBuilder took 1247.24ms. Allocated memory was 200.3MB in the beginning and 285.2MB in the end (delta: 84.9MB). Free memory was 149.9MB in the beginning and 190.3MB in the end (delta: -40.4MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-02-08 23:59:22,587 INFO L158 Benchmark]: TraceAbstraction took 15800.26ms. Allocated memory was 285.2MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 189.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-02-08 23:59:22,590 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.52ms. Allocated memory is still 200.3MB. Free memory was 171.1MB in the beginning and 155.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 200.3MB. Free memory was 155.7MB in the beginning and 153.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 200.3MB. Free memory was 152.5MB in the beginning and 149.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1247.24ms. Allocated memory was 200.3MB in the beginning and 285.2MB in the end (delta: 84.9MB). Free memory was 149.9MB in the beginning and 190.3MB in the end (delta: -40.4MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15800.26ms. Allocated memory was 285.2MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 189.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={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] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={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] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={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] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={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] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=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=1, 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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=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=1, 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] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, 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=1, 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=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, 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=1, 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=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, 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=0, x$r_buff0_thd3=1, 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=2] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L827] 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) [L827] 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) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 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 [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 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 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 15.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.3s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4986 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4986 mSDsluCounter, 15616 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13663 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3286 IncrementalHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 2700 mSDtfsCounter, 3286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13762occurred in iteration=0, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 7110 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1712 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1604 ConstructedInterpolants, 0 QuantifiedInterpolants, 10644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-08 23:59:22,631 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...