/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/mix033.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 16:18:38,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 16:18:38,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 16:18:38,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 16:18:38,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 16:18:38,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 16:18:38,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 16:18:38,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 16:18:38,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 16:18:38,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 16:18:38,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 16:18:38,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 16:18:38,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 16:18:38,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 16:18:38,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 16:18:38,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 16:18:38,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 16:18:38,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 16:18:38,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 16:18:38,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 16:18:38,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 16:18:38,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 16:18:38,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 16:18:38,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 16:18:38,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 16:18:38,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 16:18:38,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 16:18:38,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 16:18:38,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 16:18:38,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 16:18:38,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 16:18:38,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 16:18:38,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 16:18:38,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 16:18:38,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 16:18:38,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 16:18:38,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 16:18:38,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 16:18:38,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 16:18:38,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 16:18:38,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 16:18:38,972 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-03-03 16:18:39,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 16:18:39,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 16:18:39,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 16:18:39,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 16:18:39,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 16:18:39,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 16:18:39,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 16:18:39,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 16:18:39,009 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 16:18:39,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 16:18:39,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 16:18:39,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 16:18:39,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 16:18:39,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:18:39,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 16:18:39,013 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 16:18:39,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 16:18:39,014 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-03-03 16:18:39,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 16:18:39,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 16:18:39,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 16:18:39,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 16:18:39,242 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 16:18:39,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-03-03 16:18:39,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddcd2961/1d598a33f5614c03b766567521a825da/FLAG419c15c79 [2022-03-03 16:18:39,810 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 16:18:39,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-03-03 16:18:39,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddcd2961/1d598a33f5614c03b766567521a825da/FLAG419c15c79 [2022-03-03 16:18:40,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddcd2961/1d598a33f5614c03b766567521a825da [2022-03-03 16:18:40,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 16:18:40,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 16:18:40,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 16:18:40,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 16:18:40,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 16:18:40,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49336443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40, skipping insertion in model container [2022-03-03 16:18:40,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 16:18:40,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 16:18:40,487 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/mix033.opt.i[944,957] [2022-03-03 16:18:40,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:18:40,642 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 16:18:40,653 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/mix033.opt.i[944,957] [2022-03-03 16:18:40,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:18:40,715 INFO L208 MainTranslator]: Completed translation [2022-03-03 16:18:40,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40 WrapperNode [2022-03-03 16:18:40,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 16:18:40,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 16:18:40,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 16:18:40,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 16:18:40,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,793 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 186 [2022-03-03 16:18:40,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 16:18:40,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 16:18:40,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 16:18:40,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 16:18:40,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 16:18:40,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 16:18:40,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 16:18:40,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 16:18:40,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (1/1) ... [2022-03-03 16:18:40,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:18:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:18:40,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 16:18:40,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 16:18:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 16:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 16:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 16:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 16:18:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 16:18:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-03 16:18:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-03 16:18:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-03 16:18:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-03 16:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-03 16:18:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-03 16:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 16:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 16:18:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 16:18:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 16:18:40,930 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 16:18:41,072 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 16:18:41,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 16:18:41,618 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 16:18:41,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 16:18:41,936 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-03 16:18:41,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:18:41 BoogieIcfgContainer [2022-03-03 16:18:41,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 16:18:41,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 16:18:41,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 16:18:41,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 16:18:41,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:18:40" (1/3) ... [2022-03-03 16:18:41,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39613951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:18:41, skipping insertion in model container [2022-03-03 16:18:41,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:40" (2/3) ... [2022-03-03 16:18:41,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39613951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:18:41, skipping insertion in model container [2022-03-03 16:18:41,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:18:41" (3/3) ... [2022-03-03 16:18:41,949 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-03-03 16:18:41,954 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 16:18:41,954 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 16:18:41,954 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-03 16:18:41,954 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 16:18:42,001 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,001 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,001 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,001 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,001 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,002 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,002 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,002 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,002 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,003 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,003 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,003 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,003 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,004 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,005 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,005 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,005 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,006 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,007 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,008 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,009 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,010 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,010 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,010 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,010 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,013 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,025 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,029 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,029 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,030 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,030 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,033 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,034 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,035 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,035 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,035 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,035 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,035 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,036 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,036 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,036 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,036 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,042 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,043 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,043 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,043 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,045 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,045 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,047 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,048 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:18:42,049 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 16:18:42,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 16:18:42,110 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 16:18:42,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-03 16:18:42,123 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 121 transitions, 257 flow [2022-03-03 16:18:42,865 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16161 states, 16158 states have (on average 3.5926476049015967) internal successors, (58050), 16160 states have internal predecessors, (58050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 16161 states, 16158 states have (on average 3.5926476049015967) internal successors, (58050), 16160 states have internal predecessors, (58050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-03 16:18:43,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:43,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:43,011 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -737254169, now seen corresponding path program 1 times [2022-03-03 16:18:43,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:43,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963732567] [2022-03-03 16:18:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:43,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:43,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963732567] [2022-03-03 16:18:43,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963732567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:43,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:43,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 16:18:43,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038440610] [2022-03-03 16:18:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:43,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:18:43,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:18:43,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:18:43,498 INFO L87 Difference]: Start difference. First operand has 16161 states, 16158 states have (on average 3.5926476049015967) internal successors, (58050), 16160 states have internal predecessors, (58050), 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 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:43,882 INFO L93 Difference]: Finished difference Result 14019 states and 49270 transitions. [2022-03-03 16:18:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:18:43,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2022-03-03 16:18:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:44,023 INFO L225 Difference]: With dead ends: 14019 [2022-03-03 16:18:44,024 INFO L226 Difference]: Without dead ends: 11877 [2022-03-03 16:18:44,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:18:44,035 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 42 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:44,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 176 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:18:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2022-03-03 16:18:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 11877. [2022-03-03 16:18:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11877 states, 11876 states have (on average 3.5420175143145842) internal successors, (42065), 11876 states have internal predecessors, (42065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11877 states to 11877 states and 42065 transitions. [2022-03-03 16:18:44,694 INFO L78 Accepts]: Start accepts. Automaton has 11877 states and 42065 transitions. Word has length 63 [2022-03-03 16:18:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:44,696 INFO L470 AbstractCegarLoop]: Abstraction has 11877 states and 42065 transitions. [2022-03-03 16:18:44,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 11877 states and 42065 transitions. [2022-03-03 16:18:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 16:18:44,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:44,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:44,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 16:18:44,723 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash 209728125, now seen corresponding path program 1 times [2022-03-03 16:18:44,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:44,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973398647] [2022-03-03 16:18:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:45,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:45,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973398647] [2022-03-03 16:18:45,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973398647] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:45,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:45,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 16:18:45,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552835825] [2022-03-03 16:18:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:45,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 16:18:45,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 16:18:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 16:18:45,213 INFO L87 Difference]: Start difference. First operand 11877 states and 42065 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:45,861 INFO L93 Difference]: Finished difference Result 22375 states and 77861 transitions. [2022-03-03 16:18:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 16:18:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78 [2022-03-03 16:18:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:46,047 INFO L225 Difference]: With dead ends: 22375 [2022-03-03 16:18:46,047 INFO L226 Difference]: Without dead ends: 16705 [2022-03-03 16:18:46,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-03 16:18:46,049 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 141 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:46,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 679 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 16:18:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2022-03-03 16:18:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 14409. [2022-03-03 16:18:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14409 states, 14408 states have (on average 3.4970849528039976) internal successors, (50386), 14408 states have internal predecessors, (50386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 50386 transitions. [2022-03-03 16:18:46,839 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 50386 transitions. Word has length 78 [2022-03-03 16:18:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:46,840 INFO L470 AbstractCegarLoop]: Abstraction has 14409 states and 50386 transitions. [2022-03-03 16:18:46,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 50386 transitions. [2022-03-03 16:18:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-03-03 16:18:46,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:46,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:46,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 16:18:46,879 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1832762334, now seen corresponding path program 1 times [2022-03-03 16:18:46,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:46,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290814670] [2022-03-03 16:18:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:47,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:47,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290814670] [2022-03-03 16:18:47,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290814670] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:47,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:47,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:18:47,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13259330] [2022-03-03 16:18:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:47,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:18:47,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:18:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:18:47,135 INFO L87 Difference]: Start difference. First operand 14409 states and 50386 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:47,668 INFO L93 Difference]: Finished difference Result 18111 states and 62469 transitions. [2022-03-03 16:18:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 16:18:47,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-03-03 16:18:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:47,759 INFO L225 Difference]: With dead ends: 18111 [2022-03-03 16:18:47,759 INFO L226 Difference]: Without dead ends: 14241 [2022-03-03 16:18:47,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-03-03 16:18:47,761 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 246 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:47,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 678 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 16:18:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14241 states. [2022-03-03 16:18:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14241 to 11377. [2022-03-03 16:18:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11377 states, 11376 states have (on average 3.4637834036568216) internal successors, (39404), 11376 states have internal predecessors, (39404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11377 states to 11377 states and 39404 transitions. [2022-03-03 16:18:48,279 INFO L78 Accepts]: Start accepts. Automaton has 11377 states and 39404 transitions. Word has length 80 [2022-03-03 16:18:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:48,280 INFO L470 AbstractCegarLoop]: Abstraction has 11377 states and 39404 transitions. [2022-03-03 16:18:48,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11377 states and 39404 transitions. [2022-03-03 16:18:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-03-03 16:18:48,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:48,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:48,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 16:18:48,400 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1596870337, now seen corresponding path program 1 times [2022-03-03 16:18:48,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:48,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259734890] [2022-03-03 16:18:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:48,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:48,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259734890] [2022-03-03 16:18:48,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259734890] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:48,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:48,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:18:48,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114781400] [2022-03-03 16:18:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:48,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:18:48,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:48,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:18:48,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:18:48,662 INFO L87 Difference]: Start difference. First operand 11377 states and 39404 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:49,076 INFO L93 Difference]: Finished difference Result 14643 states and 50155 transitions. [2022-03-03 16:18:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 16:18:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-03-03 16:18:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:49,136 INFO L225 Difference]: With dead ends: 14643 [2022-03-03 16:18:49,137 INFO L226 Difference]: Without dead ends: 12293 [2022-03-03 16:18:49,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-03-03 16:18:49,145 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 194 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:49,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 723 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 16:18:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12293 states. [2022-03-03 16:18:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12293 to 9377. [2022-03-03 16:18:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9377 states, 9376 states have (on average 3.4576578498293515) internal successors, (32419), 9376 states have internal predecessors, (32419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9377 states to 9377 states and 32419 transitions. [2022-03-03 16:18:49,499 INFO L78 Accepts]: Start accepts. Automaton has 9377 states and 32419 transitions. Word has length 82 [2022-03-03 16:18:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:49,501 INFO L470 AbstractCegarLoop]: Abstraction has 9377 states and 32419 transitions. [2022-03-03 16:18:49,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9377 states and 32419 transitions. [2022-03-03 16:18:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-03 16:18:49,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:49,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:49,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 16:18:49,537 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1533204130, now seen corresponding path program 1 times [2022-03-03 16:18:49,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:49,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486226905] [2022-03-03 16:18:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:49,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:49,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486226905] [2022-03-03 16:18:49,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486226905] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:49,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:49,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 16:18:49,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478633806] [2022-03-03 16:18:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:49,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 16:18:49,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 16:18:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 16:18:49,689 INFO L87 Difference]: Start difference. First operand 9377 states and 32419 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-03-03 16:18:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:49,906 INFO L93 Difference]: Finished difference Result 11183 states and 37856 transitions. [2022-03-03 16:18:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 16:18:49,907 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-03-03 16:18:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:49,941 INFO L225 Difference]: With dead ends: 11183 [2022-03-03 16:18:49,942 INFO L226 Difference]: Without dead ends: 7833 [2022-03-03 16:18:49,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-03 16:18:49,943 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 188 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:49,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 444 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2022-03-03 16:18:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 7833. [2022-03-03 16:18:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7833 states, 7832 states have (on average 3.3527834525025537) internal successors, (26259), 7832 states have internal predecessors, (26259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 26259 transitions. [2022-03-03 16:18:50,192 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 26259 transitions. Word has length 86 [2022-03-03 16:18:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:50,193 INFO L470 AbstractCegarLoop]: Abstraction has 7833 states and 26259 transitions. [2022-03-03 16:18:50,193 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-03-03 16:18:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 26259 transitions. [2022-03-03 16:18:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-03 16:18:50,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:50,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:50,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 16:18:50,213 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash 178298755, now seen corresponding path program 1 times [2022-03-03 16:18:50,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:50,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621469313] [2022-03-03 16:18:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:50,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:50,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621469313] [2022-03-03 16:18:50,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621469313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:50,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:50,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:18:50,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566693835] [2022-03-03 16:18:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:50,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:18:50,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:18:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:18:50,389 INFO L87 Difference]: Start difference. First operand 7833 states and 26259 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-03-03 16:18:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:50,634 INFO L93 Difference]: Finished difference Result 7377 states and 23996 transitions. [2022-03-03 16:18:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:18:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-03-03 16:18:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:50,665 INFO L225 Difference]: With dead ends: 7377 [2022-03-03 16:18:50,665 INFO L226 Difference]: Without dead ends: 4887 [2022-03-03 16:18:50,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-03 16:18:50,667 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 311 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:50,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 520 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2022-03-03 16:18:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4875. [2022-03-03 16:18:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 3.1776774723020105) internal successors, (15488), 4874 states have internal predecessors, (15488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 15488 transitions. [2022-03-03 16:18:50,823 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 15488 transitions. Word has length 88 [2022-03-03 16:18:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:50,823 INFO L470 AbstractCegarLoop]: Abstraction has 4875 states and 15488 transitions. [2022-03-03 16:18:50,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-03-03 16:18:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 15488 transitions. [2022-03-03 16:18:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-03 16:18:50,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:50,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:50,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 16:18:50,836 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2081907830, now seen corresponding path program 1 times [2022-03-03 16:18:50,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:50,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107774371] [2022-03-03 16:18:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:51,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:51,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107774371] [2022-03-03 16:18:51,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107774371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:51,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:51,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-03 16:18:51,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283501185] [2022-03-03 16:18:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:51,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 16:18:51,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 16:18:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-03 16:18:51,024 INFO L87 Difference]: Start difference. First operand 4875 states and 15488 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:51,254 INFO L93 Difference]: Finished difference Result 3930 states and 12293 transitions. [2022-03-03 16:18:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 16:18:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2022-03-03 16:18:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:51,265 INFO L225 Difference]: With dead ends: 3930 [2022-03-03 16:18:51,265 INFO L226 Difference]: Without dead ends: 2760 [2022-03-03 16:18:51,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-03 16:18:51,266 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 327 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:51,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 543 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2022-03-03 16:18:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2652. [2022-03-03 16:18:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 3.079969822708412) internal successors, (8165), 2651 states have internal predecessors, (8165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 8165 transitions. [2022-03-03 16:18:51,342 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 8165 transitions. Word has length 91 [2022-03-03 16:18:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:51,343 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 8165 transitions. [2022-03-03 16:18:51,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 8165 transitions. [2022-03-03 16:18:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:18:51,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:51,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:51,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 16:18:51,350 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1349720852, now seen corresponding path program 1 times [2022-03-03 16:18:51,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:51,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565139765] [2022-03-03 16:18:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:51,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:51,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565139765] [2022-03-03 16:18:51,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565139765] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:51,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:51,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-03 16:18:51,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915261828] [2022-03-03 16:18:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:51,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 16:18:51,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 16:18:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-03-03 16:18:51,589 INFO L87 Difference]: Start difference. First operand 2652 states and 8165 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:51,826 INFO L93 Difference]: Finished difference Result 5398 states and 16835 transitions. [2022-03-03 16:18:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:18:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:51,842 INFO L225 Difference]: With dead ends: 5398 [2022-03-03 16:18:51,842 INFO L226 Difference]: Without dead ends: 4507 [2022-03-03 16:18:51,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-03 16:18:51,843 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 162 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:51,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 760 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2022-03-03 16:18:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 2652. [2022-03-03 16:18:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 3.070916635231988) internal successors, (8141), 2651 states have internal predecessors, (8141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 8141 transitions. [2022-03-03 16:18:51,945 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 8141 transitions. Word has length 95 [2022-03-03 16:18:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:51,946 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 8141 transitions. [2022-03-03 16:18:51,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 8141 transitions. [2022-03-03 16:18:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:18:51,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:51,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:51,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 16:18:51,954 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1741452552, now seen corresponding path program 2 times [2022-03-03 16:18:51,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:51,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095987049] [2022-03-03 16:18:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:52,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:52,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095987049] [2022-03-03 16:18:52,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095987049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:52,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:52,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:18:52,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124293785] [2022-03-03 16:18:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:52,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:18:52,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:52,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:18:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:18:52,134 INFO L87 Difference]: Start difference. First operand 2652 states and 8141 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-03-03 16:18:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:52,342 INFO L93 Difference]: Finished difference Result 4138 states and 12698 transitions. [2022-03-03 16:18:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 16:18:52,343 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-03-03 16:18:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:52,351 INFO L225 Difference]: With dead ends: 4138 [2022-03-03 16:18:52,352 INFO L226 Difference]: Without dead ends: 2579 [2022-03-03 16:18:52,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-03-03 16:18:52,353 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 161 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:52,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 678 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2022-03-03 16:18:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2036. [2022-03-03 16:18:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 2035 states have (on average 3.0275184275184275) internal successors, (6161), 2035 states have internal predecessors, (6161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 6161 transitions. [2022-03-03 16:18:52,416 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 6161 transitions. Word has length 95 [2022-03-03 16:18:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:52,416 INFO L470 AbstractCegarLoop]: Abstraction has 2036 states and 6161 transitions. [2022-03-03 16:18:52,416 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-03-03 16:18:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 6161 transitions. [2022-03-03 16:18:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:18:52,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:52,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:52,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 16:18:52,422 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1560285896, now seen corresponding path program 3 times [2022-03-03 16:18:52,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:52,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841655608] [2022-03-03 16:18:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:52,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:52,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841655608] [2022-03-03 16:18:52,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841655608] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:52,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:52,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 16:18:52,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396487246] [2022-03-03 16:18:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:52,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 16:18:52,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 16:18:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 16:18:52,534 INFO L87 Difference]: Start difference. First operand 2036 states and 6161 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03-03 16:18:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:52,634 INFO L93 Difference]: Finished difference Result 3071 states and 9263 transitions. [2022-03-03 16:18:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 16:18:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03-03 16:18:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:52,639 INFO L225 Difference]: With dead ends: 3071 [2022-03-03 16:18:52,639 INFO L226 Difference]: Without dead ends: 1703 [2022-03-03 16:18:52,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-03 16:18:52,640 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 59 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:52,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 588 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 16:18:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-03-03 16:18:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1703. [2022-03-03 16:18:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 2.9430082256169214) internal successors, (5009), 1702 states have internal predecessors, (5009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 5009 transitions. [2022-03-03 16:18:52,675 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 5009 transitions. Word has length 95 [2022-03-03 16:18:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:52,675 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 5009 transitions. [2022-03-03 16:18:52,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03-03 16:18:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 5009 transitions. [2022-03-03 16:18:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:18:52,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:52,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:52,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 16:18:52,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1951507786, now seen corresponding path program 4 times [2022-03-03 16:18:52,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:52,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862800930] [2022-03-03 16:18:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:18:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:18:52,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:18:52,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862800930] [2022-03-03 16:18:52,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862800930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:18:52,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:18:52,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-03 16:18:52,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832452966] [2022-03-03 16:18:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:18:52,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 16:18:52,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:18:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 16:18:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-03 16:18:52,937 INFO L87 Difference]: Start difference. First operand 1703 states and 5009 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:18:53,078 INFO L93 Difference]: Finished difference Result 2246 states and 6622 transitions. [2022-03-03 16:18:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:18:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:18:53,082 INFO L225 Difference]: With dead ends: 2246 [2022-03-03 16:18:53,083 INFO L226 Difference]: Without dead ends: 1391 [2022-03-03 16:18:53,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-03 16:18:53,084 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 16:18:53,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 869 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 16:18:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2022-03-03 16:18:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2022-03-03 16:18:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 2.849640287769784) internal successors, (3961), 1390 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 16:18:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3961 transitions. [2022-03-03 16:18:53,116 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 3961 transitions. Word has length 95 [2022-03-03 16:18:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:18:53,117 INFO L470 AbstractCegarLoop]: Abstraction has 1391 states and 3961 transitions. [2022-03-03 16:18:53,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-03-03 16:18:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 3961 transitions. [2022-03-03 16:18:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-03 16:18:53,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:18:53,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:53,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 16:18:53,122 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 16:18:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:18:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1145399990, now seen corresponding path program 5 times [2022-03-03 16:18:53,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:18:53,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64754908] [2022-03-03 16:18:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:18:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:18:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 16:18:53,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-03 16:18:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 16:18:53,235 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-03 16:18:53,236 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-03 16:18:53,236 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-03 16:18:53,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-03 16:18:53,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-03 16:18:53,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-03 16:18:53,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-03 16:18:53,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-03 16:18:53,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 16:18:53,242 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 16:18:53,246 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 16:18:53,246 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 16:18:53,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:18:53 BasicIcfg [2022-03-03 16:18:53,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 16:18:53,402 INFO L158 Benchmark]: Toolchain (without parser) took 13118.93ms. Allocated memory was 202.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 149.5MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 352.8MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,402 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory was 168.2MB in the beginning and 168.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 16:18:53,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.31ms. Allocated memory is still 202.4MB. Free memory was 149.3MB in the beginning and 164.8MB in the end (delta: -15.5MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.47ms. Allocated memory is still 202.4MB. Free memory was 164.8MB in the beginning and 162.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,403 INFO L158 Benchmark]: Boogie Preprocessor took 52.38ms. Allocated memory is still 202.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,403 INFO L158 Benchmark]: RCFGBuilder took 1090.17ms. Allocated memory is still 202.4MB. Free memory was 160.1MB in the beginning and 95.1MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,403 INFO L158 Benchmark]: TraceAbstraction took 11461.70ms. Allocated memory was 202.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 94.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 298.2MB. Max. memory is 8.0GB. [2022-03-03 16:18:53,405 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.13ms. Allocated memory is still 202.4MB. Free memory was 168.2MB in the beginning and 168.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 431.31ms. Allocated memory is still 202.4MB. Free memory was 149.3MB in the beginning and 164.8MB in the end (delta: -15.5MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.47ms. Allocated memory is still 202.4MB. Free memory was 164.8MB in the beginning and 162.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.38ms. Allocated memory is still 202.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1090.17ms. Allocated memory is still 202.4MB. Free memory was 160.1MB in the beginning and 95.1MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11461.70ms. Allocated memory was 202.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 94.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 298.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L843] 0 pthread_t t876; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-2, t876={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t877; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-1, t876={5:0}, t877={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 0 pthread_t t878; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t878, ((void *)0), P2, ((void *)0))=0, t876={5:0}, t877={6:0}, t878={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 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) [L821] 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) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 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 [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 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 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] 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) [L854] 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) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 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 [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 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 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, 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=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, 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: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1975 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1975 mSDsluCounter, 6658 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5532 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1104 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 1552 mSDtfsCounter, 1104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16161occurred in iteration=0, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10594 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 4590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-03 16:18:53,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...