/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/mix044.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:42:53,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:42:53,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:42:53,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:42:53,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:42:53,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:42:53,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:42:53,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:42:53,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:42:53,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:42:53,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:42:53,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:42:53,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:42:53,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:42:53,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:42:53,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:42:53,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:42:53,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:42:53,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:42:53,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:42:53,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:42:53,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:42:53,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:42:53,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:42:53,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:42:53,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:42:53,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:42:53,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:42:53,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:42:53,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:42:53,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:42:53,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:42:53,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:42:53,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:42:53,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:42:53,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:42:53,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:42:53,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:42:53,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:42:53,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:42:53,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:42:53,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 21:42:53,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:42:53,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:42:53,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:42:53,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:42:53,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:42:53,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:42:53,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:42:53,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:42:53,983 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:42:53,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:42:53,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:42:53,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:42:53,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:42:53,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:42:53,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:42:53,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:42:53,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:42:53,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:42:53,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:42:53,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:42:53,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:42:53,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:42:53,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 21:42:54,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:42:54,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:42:54,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:42:54,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:42:54,276 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:42:54,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-02-10 21:42:54,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4940f/470ff70fc8f646719c98115e8c6623c3/FLAG59923c90b [2022-02-10 21:42:54,832 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:42:54,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-02-10 21:42:54,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4940f/470ff70fc8f646719c98115e8c6623c3/FLAG59923c90b [2022-02-10 21:42:55,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0c4940f/470ff70fc8f646719c98115e8c6623c3 [2022-02-10 21:42:55,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:42:55,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:42:55,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:42:55,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:42:55,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:42:55,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295e0864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55, skipping insertion in model container [2022-02-10 21:42:55,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:42:55,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:42:55,423 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/mix044.opt.i[944,957] [2022-02-10 21:42:55,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:42:55,587 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:42:55,599 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/mix044.opt.i[944,957] [2022-02-10 21:42:55,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:42:55,712 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:42:55,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55 WrapperNode [2022-02-10 21:42:55,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:42:55,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:42:55,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:42:55,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:42:55,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,786 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-02-10 21:42:55,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:42:55,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:42:55,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:42:55,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:42:55,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:42:55,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:42:55,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:42:55,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:42:55,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (1/1) ... [2022-02-10 21:42:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:42:55,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:42:55,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-10 21:42:55,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-10 21:42:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:42:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:42:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:42:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:42:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:42:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:42:55,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:42:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:42:55,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:42:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-10 21:42:55,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-10 21:42:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-02-10 21:42:55,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-02-10 21:42:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:42:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:42:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:42:55,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:42:55,922 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:42:56,104 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:42:56,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:42:56,489 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:42:56,835 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:42:56,836 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:42:56,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:42:56 BoogieIcfgContainer [2022-02-10 21:42:56,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:42:56,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:42:56,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:42:56,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:42:56,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:42:55" (1/3) ... [2022-02-10 21:42:56,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69953c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:42:56, skipping insertion in model container [2022-02-10 21:42:56,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:42:55" (2/3) ... [2022-02-10 21:42:56,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69953c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:42:56, skipping insertion in model container [2022-02-10 21:42:56,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:42:56" (3/3) ... [2022-02-10 21:42:56,847 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-02-10 21:42:56,852 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:42:56,852 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:42:56,852 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:42:56,852 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:42:56,902 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,903 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,903 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,903 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,903 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,903 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,904 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,904 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,904 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,905 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,905 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,905 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,905 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,906 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,906 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,906 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,906 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,906 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,907 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,907 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,907 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,907 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,907 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,908 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,909 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,910 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,911 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,912 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,913 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,914 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,915 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,915 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,915 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,915 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,916 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,916 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,916 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,917 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,918 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,919 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,919 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,920 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,920 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,921 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,924 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,925 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,925 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,927 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,932 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,932 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,933 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,934 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,934 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,934 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,934 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,935 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,936 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,936 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,936 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,936 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,936 WARN L322 ript$VariableManager]: TermVariable |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:42:56,938 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:42:56,981 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:42:56,988 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:42:56,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-10 21:42:57,003 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 137 transitions, 294 flow [2022-02-10 21:43:00,810 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 21:43:01,035 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:01,036 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:01,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1364924999, now seen corresponding path program 1 times [2022-02-10 21:43:01,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:01,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704634717] [2022-02-10 21:43:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:01,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:01,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704634717] [2022-02-10 21:43:01,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704634717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:01,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:01,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:43:01,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121427774] [2022-02-10 21:43:01,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:01,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:43:01,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:43:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:43:01,747 INFO L87 Difference]: Start difference. First operand has 102752 states, 102749 states have (on average 4.4352061820553) internal successors, (455713), 102751 states have internal predecessors, (455713), 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 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:04,695 INFO L93 Difference]: Finished difference Result 88640 states and 386245 transitions. [2022-02-10 21:43:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:43:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-10 21:43:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:05,548 INFO L225 Difference]: With dead ends: 88640 [2022-02-10 21:43:05,549 INFO L226 Difference]: Without dead ends: 73744 [2022-02-10 21:43:05,554 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:43:05,560 INFO L934 BasicCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:05,562 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73744 states. [2022-02-10 21:43:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73744 to 73744. [2022-02-10 21:43:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73744 states, 73743 states have (on average 4.390423497823522) internal successors, (323763), 73743 states have internal predecessors, (323763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73744 states to 73744 states and 323763 transitions. [2022-02-10 21:43:10,484 INFO L78 Accepts]: Start accepts. Automaton has 73744 states and 323763 transitions. Word has length 71 [2022-02-10 21:43:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:10,485 INFO L470 AbstractCegarLoop]: Abstraction has 73744 states and 323763 transitions. [2022-02-10 21:43:10,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 73744 states and 323763 transitions. [2022-02-10 21:43:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-10 21:43:10,644 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:10,644 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:10,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:43:10,645 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash -836884992, now seen corresponding path program 1 times [2022-02-10 21:43:10,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:10,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419828768] [2022-02-10 21:43:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:10,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:10,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419828768] [2022-02-10 21:43:10,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419828768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:10,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:10,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:43:10,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18121797] [2022-02-10 21:43:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:10,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:43:10,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:43:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:43:10,919 INFO L87 Difference]: Start difference. First operand 73744 states and 323763 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-10 21:43:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:12,573 INFO L93 Difference]: Finished difference Result 89984 states and 392269 transitions. [2022-02-10 21:43:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:43:12,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-10 21:43:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:13,303 INFO L225 Difference]: With dead ends: 89984 [2022-02-10 21:43:13,304 INFO L226 Difference]: Without dead ends: 70384 [2022-02-10 21:43:13,308 INFO L933 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-10 21:43:13,309 INFO L934 BasicCegarLoop]: 178 mSDtfsCounter, 179 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:13,309 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 703 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70384 states. [2022-02-10 21:43:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70384 to 70384. [2022-02-10 21:43:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70384 states, 70383 states have (on average 4.372064276885043) internal successors, (307719), 70383 states have internal predecessors, (307719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70384 states to 70384 states and 307719 transitions. [2022-02-10 21:43:17,040 INFO L78 Accepts]: Start accepts. Automaton has 70384 states and 307719 transitions. Word has length 86 [2022-02-10 21:43:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:17,040 INFO L470 AbstractCegarLoop]: Abstraction has 70384 states and 307719 transitions. [2022-02-10 21:43:17,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-10 21:43:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 70384 states and 307719 transitions. [2022-02-10 21:43:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-10 21:43:17,162 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:17,163 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:17,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:43:17,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 900137695, now seen corresponding path program 1 times [2022-02-10 21:43:17,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:17,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171974283] [2022-02-10 21:43:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:17,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:17,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:17,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171974283] [2022-02-10 21:43:17,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171974283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:17,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:17,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:43:17,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970624225] [2022-02-10 21:43:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:17,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:43:17,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:43:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:43:17,339 INFO L87 Difference]: Start difference. First operand 70384 states and 307719 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-10 21:43:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:18,891 INFO L93 Difference]: Finished difference Result 77952 states and 338365 transitions. [2022-02-10 21:43:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:43:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-10 21:43:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:19,410 INFO L225 Difference]: With dead ends: 77952 [2022-02-10 21:43:19,411 INFO L226 Difference]: Without dead ends: 60752 [2022-02-10 21:43:19,411 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:43:19,412 INFO L934 BasicCegarLoop]: 178 mSDtfsCounter, 174 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:19,413 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 671 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60752 states. [2022-02-10 21:43:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60752 to 60752. [2022-02-10 21:43:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60752 states, 60751 states have (on average 4.34394495563859) internal successors, (263899), 60751 states have internal predecessors, (263899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60752 states to 60752 states and 263899 transitions. [2022-02-10 21:43:22,729 INFO L78 Accepts]: Start accepts. Automaton has 60752 states and 263899 transitions. Word has length 88 [2022-02-10 21:43:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:22,729 INFO L470 AbstractCegarLoop]: Abstraction has 60752 states and 263899 transitions. [2022-02-10 21:43:22,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-10 21:43:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 60752 states and 263899 transitions. [2022-02-10 21:43:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-10 21:43:22,852 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:22,852 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:22,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:43:22,852 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash -638224932, now seen corresponding path program 1 times [2022-02-10 21:43:22,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:22,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841841147] [2022-02-10 21:43:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:23,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:23,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841841147] [2022-02-10 21:43:23,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841841147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:23,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:23,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:43:23,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872670645] [2022-02-10 21:43:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:23,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:43:23,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:43:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:43:23,200 INFO L87 Difference]: Start difference. First operand 60752 states and 263899 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:24,459 INFO L93 Difference]: Finished difference Result 69266 states and 298881 transitions. [2022-02-10 21:43:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:43:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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 92 [2022-02-10 21:43:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:25,162 INFO L225 Difference]: With dead ends: 69266 [2022-02-10 21:43:25,163 INFO L226 Difference]: Without dead ends: 58946 [2022-02-10 21:43:25,163 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-02-10 21:43:25,164 INFO L934 BasicCegarLoop]: 169 mSDtfsCounter, 384 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:25,165 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1098 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58946 states. [2022-02-10 21:43:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58946 to 58946. [2022-02-10 21:43:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58946 states, 58945 states have (on average 4.33381966239715) internal successors, (255457), 58945 states have internal predecessors, (255457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58946 states to 58946 states and 255457 transitions. [2022-02-10 21:43:27,906 INFO L78 Accepts]: Start accepts. Automaton has 58946 states and 255457 transitions. Word has length 92 [2022-02-10 21:43:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:27,906 INFO L470 AbstractCegarLoop]: Abstraction has 58946 states and 255457 transitions. [2022-02-10 21:43:27,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58946 states and 255457 transitions. [2022-02-10 21:43:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-10 21:43:28,084 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:28,084 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:28,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:43:28,084 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 874508027, now seen corresponding path program 1 times [2022-02-10 21:43:28,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:28,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177133452] [2022-02-10 21:43:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:28,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:28,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177133452] [2022-02-10 21:43:28,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177133452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:28,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:28,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:43:28,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197829228] [2022-02-10 21:43:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:28,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:43:28,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:43:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:43:28,311 INFO L87 Difference]: Start difference. First operand 58946 states and 255457 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:29,422 INFO L93 Difference]: Finished difference Result 73436 states and 314537 transitions. [2022-02-10 21:43:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:43:29,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 94 [2022-02-10 21:43:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:29,741 INFO L225 Difference]: With dead ends: 73436 [2022-02-10 21:43:29,742 INFO L226 Difference]: Without dead ends: 53836 [2022-02-10 21:43:29,742 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:43:29,744 INFO L934 BasicCegarLoop]: 140 mSDtfsCounter, 237 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:29,744 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 510 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53836 states. [2022-02-10 21:43:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53836 to 53836. [2022-02-10 21:43:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53836 states, 53835 states have (on average 4.270586049967493) internal successors, (229907), 53835 states have internal predecessors, (229907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53836 states to 53836 states and 229907 transitions. [2022-02-10 21:43:32,525 INFO L78 Accepts]: Start accepts. Automaton has 53836 states and 229907 transitions. Word has length 94 [2022-02-10 21:43:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:32,525 INFO L470 AbstractCegarLoop]: Abstraction has 53836 states and 229907 transitions. [2022-02-10 21:43:32,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53836 states and 229907 transitions. [2022-02-10 21:43:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-10 21:43:32,683 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:32,683 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:32,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:43:32,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -581858219, now seen corresponding path program 1 times [2022-02-10 21:43:32,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:32,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894073042] [2022-02-10 21:43:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:32,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:32,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894073042] [2022-02-10 21:43:32,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894073042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:32,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:32,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:43:32,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335908500] [2022-02-10 21:43:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:32,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:43:32,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:43:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:43:32,883 INFO L87 Difference]: Start difference. First operand 53836 states and 229907 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:34,071 INFO L93 Difference]: Finished difference Result 56116 states and 234193 transitions. [2022-02-10 21:43:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:43:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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 95 [2022-02-10 21:43:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:34,290 INFO L225 Difference]: With dead ends: 56116 [2022-02-10 21:43:34,290 INFO L226 Difference]: Without dead ends: 39316 [2022-02-10 21:43:34,290 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:43:34,291 INFO L934 BasicCegarLoop]: 140 mSDtfsCounter, 404 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:34,292 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 605 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39316 states. [2022-02-10 21:43:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39316 to 39316. [2022-02-10 21:43:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39316 states, 39315 states have (on average 4.124303700877528) internal successors, (162147), 39315 states have internal predecessors, (162147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39316 states to 39316 states and 162147 transitions. [2022-02-10 21:43:35,981 INFO L78 Accepts]: Start accepts. Automaton has 39316 states and 162147 transitions. Word has length 95 [2022-02-10 21:43:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:35,982 INFO L470 AbstractCegarLoop]: Abstraction has 39316 states and 162147 transitions. [2022-02-10 21:43:35,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 39316 states and 162147 transitions. [2022-02-10 21:43:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-10 21:43:36,066 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:36,067 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:36,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:43:36,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 6887062, now seen corresponding path program 1 times [2022-02-10 21:43:36,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:36,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39465138] [2022-02-10 21:43:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:36,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:36,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39465138] [2022-02-10 21:43:36,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39465138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:36,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:36,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:43:36,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038742201] [2022-02-10 21:43:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:36,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:43:36,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:36,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:43:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:43:36,205 INFO L87 Difference]: Start difference. First operand 39316 states and 162147 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:37,576 INFO L93 Difference]: Finished difference Result 63529 states and 259078 transitions. [2022-02-10 21:43:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:43:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2022-02-10 21:43:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:37,981 INFO L225 Difference]: With dead ends: 63529 [2022-02-10 21:43:37,981 INFO L226 Difference]: Without dead ends: 41080 [2022-02-10 21:43:37,982 INFO L933 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-10 21:43:37,982 INFO L934 BasicCegarLoop]: 214 mSDtfsCounter, 152 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:37,987 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 886 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:43:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41080 states. [2022-02-10 21:43:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41080 to 37804. [2022-02-10 21:43:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37804 states, 37803 states have (on average 4.046821680818983) internal successors, (152982), 37803 states have internal predecessors, (152982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37804 states to 37804 states and 152982 transitions. [2022-02-10 21:43:40,252 INFO L78 Accepts]: Start accepts. Automaton has 37804 states and 152982 transitions. Word has length 97 [2022-02-10 21:43:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:40,253 INFO L470 AbstractCegarLoop]: Abstraction has 37804 states and 152982 transitions. [2022-02-10 21:43:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 37804 states and 152982 transitions. [2022-02-10 21:43:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-10 21:43:40,363 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:40,363 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:40,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:43:40,364 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1741190506, now seen corresponding path program 1 times [2022-02-10 21:43:40,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:40,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724838193] [2022-02-10 21:43:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:40,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:40,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724838193] [2022-02-10 21:43:40,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724838193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:40,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:40,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:43:40,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445507107] [2022-02-10 21:43:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:40,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:43:40,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:43:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:43:40,511 INFO L87 Difference]: Start difference. First operand 37804 states and 152982 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:41,016 INFO L93 Difference]: Finished difference Result 32845 states and 129945 transitions. [2022-02-10 21:43:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:43:41,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2022-02-10 21:43:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:41,093 INFO L225 Difference]: With dead ends: 32845 [2022-02-10 21:43:41,093 INFO L226 Difference]: Without dead ends: 23125 [2022-02-10 21:43:41,094 INFO L933 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-10 21:43:41,094 INFO L934 BasicCegarLoop]: 140 mSDtfsCounter, 474 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:41,095 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 692 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23125 states. [2022-02-10 21:43:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23125 to 23125. [2022-02-10 21:43:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23125 states, 23124 states have (on average 3.908536585365854) internal successors, (90381), 23124 states have internal predecessors, (90381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23125 states to 23125 states and 90381 transitions. [2022-02-10 21:43:42,006 INFO L78 Accepts]: Start accepts. Automaton has 23125 states and 90381 transitions. Word has length 97 [2022-02-10 21:43:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:42,006 INFO L470 AbstractCegarLoop]: Abstraction has 23125 states and 90381 transitions. [2022-02-10 21:43:42,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23125 states and 90381 transitions. [2022-02-10 21:43:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-10 21:43:42,051 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:42,051 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:42,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:43:42,052 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1700970008, now seen corresponding path program 1 times [2022-02-10 21:43:42,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:42,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567969575] [2022-02-10 21:43:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:42,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:42,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567969575] [2022-02-10 21:43:42,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567969575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:42,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:42,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:43:42,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583919366] [2022-02-10 21:43:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:42,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:43:42,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:43:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:43:42,164 INFO L87 Difference]: Start difference. First operand 23125 states and 90381 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:42,724 INFO L93 Difference]: Finished difference Result 33616 states and 130849 transitions. [2022-02-10 21:43:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 21:43:42,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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 101 [2022-02-10 21:43:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:42,797 INFO L225 Difference]: With dead ends: 33616 [2022-02-10 21:43:42,797 INFO L226 Difference]: Without dead ends: 23155 [2022-02-10 21:43:42,798 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:43:42,798 INFO L934 BasicCegarLoop]: 219 mSDtfsCounter, 136 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:42,798 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 1014 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23155 states. [2022-02-10 21:43:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23155 to 22210. [2022-02-10 21:43:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22210 states, 22209 states have (on average 3.8511414291503443) internal successors, (85530), 22209 states have internal predecessors, (85530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22210 states to 22210 states and 85530 transitions. [2022-02-10 21:43:43,530 INFO L78 Accepts]: Start accepts. Automaton has 22210 states and 85530 transitions. Word has length 101 [2022-02-10 21:43:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:43,530 INFO L470 AbstractCegarLoop]: Abstraction has 22210 states and 85530 transitions. [2022-02-10 21:43:43,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 22210 states and 85530 transitions. [2022-02-10 21:43:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-10 21:43:43,572 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:43,572 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:43,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:43:43,572 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash -253776508, now seen corresponding path program 2 times [2022-02-10 21:43:43,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:43,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661594363] [2022-02-10 21:43:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:43,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:43,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661594363] [2022-02-10 21:43:43,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661594363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:43,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:43,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:43:43,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415288073] [2022-02-10 21:43:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:43,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:43:43,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:43:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:43:43,703 INFO L87 Difference]: Start difference. First operand 22210 states and 85530 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:44,030 INFO L93 Difference]: Finished difference Result 18349 states and 70032 transitions. [2022-02-10 21:43:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 21:43:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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 101 [2022-02-10 21:43:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:44,054 INFO L225 Difference]: With dead ends: 18349 [2022-02-10 21:43:44,054 INFO L226 Difference]: Without dead ends: 6089 [2022-02-10 21:43:44,055 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-02-10 21:43:44,055 INFO L934 BasicCegarLoop]: 136 mSDtfsCounter, 581 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:44,056 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 641 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2022-02-10 21:43:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 6089. [2022-02-10 21:43:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6089 states, 6088 states have (on average 3.771024967148489) internal successors, (22958), 6088 states have internal predecessors, (22958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 22958 transitions. [2022-02-10 21:43:44,423 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 22958 transitions. Word has length 101 [2022-02-10 21:43:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:44,424 INFO L470 AbstractCegarLoop]: Abstraction has 6089 states and 22958 transitions. [2022-02-10 21:43:44,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 22958 transitions. [2022-02-10 21:43:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-10 21:43:44,436 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:44,436 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:44,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:43:44,437 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -473685746, now seen corresponding path program 1 times [2022-02-10 21:43:44,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:44,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544627537] [2022-02-10 21:43:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:44,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:44,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544627537] [2022-02-10 21:43:44,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544627537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:44,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:44,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:43:44,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366148612] [2022-02-10 21:43:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:44,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:43:44,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:43:44,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:43:44,629 INFO L87 Difference]: Start difference. First operand 6089 states and 22958 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:45,004 INFO L93 Difference]: Finished difference Result 12911 states and 48806 transitions. [2022-02-10 21:43:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:43:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 106 [2022-02-10 21:43:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:45,017 INFO L225 Difference]: With dead ends: 12911 [2022-02-10 21:43:45,017 INFO L226 Difference]: Without dead ends: 3941 [2022-02-10 21:43:45,017 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-02-10 21:43:45,018 INFO L934 BasicCegarLoop]: 199 mSDtfsCounter, 248 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:45,018 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 1438 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:43:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-02-10 21:43:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3941. [2022-02-10 21:43:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 3.6644670050761423) internal successors, (14438), 3940 states have internal predecessors, (14438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 14438 transitions. [2022-02-10 21:43:45,097 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 14438 transitions. Word has length 106 [2022-02-10 21:43:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:45,097 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 14438 transitions. [2022-02-10 21:43:45,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 14438 transitions. [2022-02-10 21:43:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-10 21:43:45,106 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:45,106 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:45,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:43:45,106 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2031295992, now seen corresponding path program 2 times [2022-02-10 21:43:45,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:45,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901842063] [2022-02-10 21:43:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:43:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:43:45,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:43:45,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901842063] [2022-02-10 21:43:45,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901842063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:43:45,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:43:45,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-10 21:43:45,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859786066] [2022-02-10 21:43:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:43:45,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-10 21:43:45,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:43:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-10 21:43:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:43:45,462 INFO L87 Difference]: Start difference. First operand 3941 states and 14438 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:43:45,655 INFO L93 Difference]: Finished difference Result 5954 states and 21867 transitions. [2022-02-10 21:43:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:43:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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 106 [2022-02-10 21:43:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:43:45,665 INFO L225 Difference]: With dead ends: 5954 [2022-02-10 21:43:45,665 INFO L226 Difference]: Without dead ends: 2933 [2022-02-10 21:43:45,665 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:43:45,666 INFO L934 BasicCegarLoop]: 143 mSDtfsCounter, 266 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:43:45,666 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 795 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:43:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2022-02-10 21:43:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2933. [2022-02-10 21:43:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2932 states have (on average 3.5409276944065486) internal successors, (10382), 2932 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 10382 transitions. [2022-02-10 21:43:45,836 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 10382 transitions. Word has length 106 [2022-02-10 21:43:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:43:45,836 INFO L470 AbstractCegarLoop]: Abstraction has 2933 states and 10382 transitions. [2022-02-10 21:43:45,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:43:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 10382 transitions. [2022-02-10 21:43:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-10 21:43:45,841 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:43:45,841 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:45,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:43:45,841 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 21:43:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:43:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -506188582, now seen corresponding path program 3 times [2022-02-10 21:43:45,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:43:45,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843579806] [2022-02-10 21:43:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:43:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:43:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:43:45,891 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:43:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:43:46,002 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:43:46,002 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:43:46,003 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-02-10 21:43:46,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-02-10 21:43:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-10 21:43:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-02-10 21:43:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-02-10 21:43:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-02-10 21:43:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-02-10 21:43:46,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:43:46,012 INFO L733 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:43:46,017 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:43:46,017 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:43:46,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:43:46 BasicIcfg [2022-02-10 21:43:46,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:43:46,208 INFO L158 Benchmark]: Toolchain (without parser) took 51045.51ms. Allocated memory was 174.1MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 125.0MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-02-10 21:43:46,209 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:43:46,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.40ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 139.3MB in the end (delta: -14.4MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-02-10 21:43:46,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.83ms. Allocated memory is still 174.1MB. Free memory was 139.3MB in the beginning and 136.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:43:46,209 INFO L158 Benchmark]: Boogie Preprocessor took 43.45ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:43:46,209 INFO L158 Benchmark]: RCFGBuilder took 1007.03ms. Allocated memory is still 174.1MB. Free memory was 134.1MB in the beginning and 132.3MB in the end (delta: 1.7MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2022-02-10 21:43:46,210 INFO L158 Benchmark]: TraceAbstraction took 49367.37ms. Allocated memory was 174.1MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 132.3MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-02-10 21:43:46,211 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.15ms. Allocated memory is still 174.1MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 548.40ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 139.3MB in the end (delta: -14.4MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.83ms. Allocated memory is still 174.1MB. Free memory was 139.3MB in the beginning and 136.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.45ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1007.03ms. Allocated memory is still 174.1MB. Free memory was 134.1MB in the beginning and 132.3MB in the end (delta: 1.7MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. * TraceAbstraction took 49367.37ms. Allocated memory was 174.1MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 132.3MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1165; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 49.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.3s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3283 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3283 mSDsluCounter, 9247 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7815 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1374 IncrementalHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 1976 mSDtfsCounter, 1374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102752occurred in iteration=0, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 4221 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1122 ConstructedInterpolants, 0 QuantifiedInterpolants, 4521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-10 21:43:46,256 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...