/usr/bin/java -Xmx16000000000 -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/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:25:23,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:25:23,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:25:24,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:25:24,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:25:24,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:25:24,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:25:24,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:25:24,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:25:24,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:25:24,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:25:24,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:25:24,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:25:24,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:25:24,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:25:24,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:25:24,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:25:24,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:25:24,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:25:24,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:25:24,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:25:24,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:25:24,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:25:24,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:25:24,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:25:24,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:25:24,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:25:24,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:25:24,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:25:24,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:25:24,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:25:24,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:25:24,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:25:24,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:25:24,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:25:24,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:25:24,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:25:24,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:25:24,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:25:24,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:25:24,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:25:24,052 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 [2021-03-10 17:25:24,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:25:24,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:25:24,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:25:24,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:25:24,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:25:24,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:25:24,080 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:25:24,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:25:24,080 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:25:24,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:25:24,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:25:24,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:25:24,082 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:25:24,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:25:24,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:25:24,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:25:24,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:25:24,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:25:24,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:25:24,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:25:24,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:25:24,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:25:24,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:25:24,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:25:24,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:25:24,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:25:24,088 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 [2021-03-10 17:25:24,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:25:24,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:25:24,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:25:24,298 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:25:24,298 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:25:24,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-10 17:25:24,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ac2bda8/9309a64ccabd4028bea40838eb59eba6/FLAG9ba0bf37c [2021-03-10 17:25:24,846 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:25:24,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-10 17:25:24,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ac2bda8/9309a64ccabd4028bea40838eb59eba6/FLAG9ba0bf37c [2021-03-10 17:25:25,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ac2bda8/9309a64ccabd4028bea40838eb59eba6 [2021-03-10 17:25:25,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:25:25,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:25:25,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:25:25,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:25:25,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:25:25,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5feff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25, skipping insertion in model container [2021-03-10 17:25:25,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:25:25,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:25:25,452 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-03-10 17:25:25,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:25:25,575 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:25:25,582 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-03-10 17:25:25,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:25:25,675 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:25:25,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25 WrapperNode [2021-03-10 17:25:25,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:25:25,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:25:25,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:25:25,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:25:25,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:25:25,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:25:25,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:25:25,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:25:25,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... [2021-03-10 17:25:25,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:25:25,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:25:25,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:25:25,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:25:25,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:25:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:25:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:25:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:25:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:25:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:25:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:25:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:25:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:25:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:25:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:25:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:25:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:25:25,841 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:25:26,998 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:25:26,998 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:25:26,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:25:26 BoogieIcfgContainer [2021-03-10 17:25:26,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:25:27,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:25:27,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:25:27,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:25:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:25:25" (1/3) ... [2021-03-10 17:25:27,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d88d48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:25:27, skipping insertion in model container [2021-03-10 17:25:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:25:25" (2/3) ... [2021-03-10 17:25:27,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d88d48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:25:27, skipping insertion in model container [2021-03-10 17:25:27,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:25:26" (3/3) ... [2021-03-10 17:25:27,003 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-03-10 17:25:27,007 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:25:27,007 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:25:27,010 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:25:27,010 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:25:27,050 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:25:27,060 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-10 17:25:27,078 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:25:27,078 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:25:27,079 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:25:27,079 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:25:27,079 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:25:27,079 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:25:27,079 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:25:27,079 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:25:27,087 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 83 transitions, 176 flow [2021-03-10 17:25:27,148 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2179 states, 2175 states have (on average 2.7875862068965516) internal successors, (6063), 2178 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 2179 states, 2175 states have (on average 2.7875862068965516) internal successors, (6063), 2178 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-03-10 17:25:27,166 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:27,167 INFO L519 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] [2021-03-10 17:25:27,168 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1474358475, now seen corresponding path program 1 times [2021-03-10 17:25:27,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:27,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103794826] [2021-03-10 17:25:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:27,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103794826] [2021-03-10 17:25:27,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:27,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:25:27,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758166220] [2021-03-10 17:25:27,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:25:27,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:25:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:25:27,367 INFO L87 Difference]: Start difference. First operand has 2179 states, 2175 states have (on average 2.7875862068965516) internal successors, (6063), 2178 states have internal predecessors, (6063), 0 states have call successors, (0), 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 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:27,415 INFO L93 Difference]: Finished difference Result 1907 states and 5121 transitions. [2021-03-10 17:25:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:25:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-03-10 17:25:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:27,428 INFO L225 Difference]: With dead ends: 1907 [2021-03-10 17:25:27,428 INFO L226 Difference]: Without dead ends: 1187 [2021-03-10 17:25:27,429 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:25:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-03-10 17:25:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2021-03-10 17:25:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 2.633220910623946) internal successors, (3123), 1186 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 3123 transitions. [2021-03-10 17:25:27,485 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 3123 transitions. Word has length 41 [2021-03-10 17:25:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:27,485 INFO L480 AbstractCegarLoop]: Abstraction has 1187 states and 3123 transitions. [2021-03-10 17:25:27,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 3123 transitions. [2021-03-10 17:25:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-03-10 17:25:27,488 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:27,488 INFO L519 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] [2021-03-10 17:25:27,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:25:27,489 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash -582562174, now seen corresponding path program 1 times [2021-03-10 17:25:27,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:27,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760988501] [2021-03-10 17:25:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:27,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760988501] [2021-03-10 17:25:27,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:27,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:25:27,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324324051] [2021-03-10 17:25:27,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:25:27,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:25:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:25:27,666 INFO L87 Difference]: Start difference. First operand 1187 states and 3123 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:27,773 INFO L93 Difference]: Finished difference Result 1315 states and 3411 transitions. [2021-03-10 17:25:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:25:27,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-03-10 17:25:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:27,778 INFO L225 Difference]: With dead ends: 1315 [2021-03-10 17:25:27,778 INFO L226 Difference]: Without dead ends: 995 [2021-03-10 17:25:27,779 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:25:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-03-10 17:25:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2021-03-10 17:25:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 2.586519114688129) internal successors, (2571), 994 states have internal predecessors, (2571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2571 transitions. [2021-03-10 17:25:27,825 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2571 transitions. Word has length 52 [2021-03-10 17:25:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 2571 transitions. [2021-03-10 17:25:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2571 transitions. [2021-03-10 17:25:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 17:25:27,827 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:27,828 INFO L519 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] [2021-03-10 17:25:27,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:25:27,828 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash 480090175, now seen corresponding path program 1 times [2021-03-10 17:25:27,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:27,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568661772] [2021-03-10 17:25:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:27,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568661772] [2021-03-10 17:25:27,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:27,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:25:27,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167681772] [2021-03-10 17:25:27,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:25:27,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:25:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:25:27,979 INFO L87 Difference]: Start difference. First operand 995 states and 2571 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:28,067 INFO L93 Difference]: Finished difference Result 1139 states and 2913 transitions. [2021-03-10 17:25:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:25:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-03-10 17:25:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:28,073 INFO L225 Difference]: With dead ends: 1139 [2021-03-10 17:25:28,073 INFO L226 Difference]: Without dead ends: 947 [2021-03-10 17:25:28,074 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:25:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-03-10 17:25:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2021-03-10 17:25:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 2.5718816067653276) internal successors, (2433), 946 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2433 transitions. [2021-03-10 17:25:28,088 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2433 transitions. Word has length 56 [2021-03-10 17:25:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:28,088 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 2433 transitions. [2021-03-10 17:25:28,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2433 transitions. [2021-03-10 17:25:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:25:28,089 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:28,090 INFO L519 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] [2021-03-10 17:25:28,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:25:28,090 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash 848358787, now seen corresponding path program 1 times [2021-03-10 17:25:28,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:28,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609301546] [2021-03-10 17:25:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:28,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609301546] [2021-03-10 17:25:28,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:28,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:25:28,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214706541] [2021-03-10 17:25:28,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:25:28,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:25:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:25:28,156 INFO L87 Difference]: Start difference. First operand 947 states and 2433 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:28,249 INFO L93 Difference]: Finished difference Result 1503 states and 3841 transitions. [2021-03-10 17:25:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:25:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-03-10 17:25:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:28,251 INFO L225 Difference]: With dead ends: 1503 [2021-03-10 17:25:28,251 INFO L226 Difference]: Without dead ends: 719 [2021-03-10 17:25:28,252 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:25:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-03-10 17:25:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-03-10 17:25:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 2.511142061281337) internal successors, (1803), 718 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1803 transitions. [2021-03-10 17:25:28,262 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1803 transitions. Word has length 57 [2021-03-10 17:25:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:28,262 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1803 transitions. [2021-03-10 17:25:28,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1803 transitions. [2021-03-10 17:25:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:25:28,263 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:28,263 INFO L519 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] [2021-03-10 17:25:28,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:25:28,264 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash 645996118, now seen corresponding path program 1 times [2021-03-10 17:25:28,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:28,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895859044] [2021-03-10 17:25:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:28,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895859044] [2021-03-10 17:25:28,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:28,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:25:28,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975364051] [2021-03-10 17:25:28,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:25:28,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:28,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:25:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:25:28,397 INFO L87 Difference]: Start difference. First operand 719 states and 1803 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:28,737 INFO L93 Difference]: Finished difference Result 853 states and 2118 transitions. [2021-03-10 17:25:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 17:25:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-03-10 17:25:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:28,744 INFO L225 Difference]: With dead ends: 853 [2021-03-10 17:25:28,744 INFO L226 Difference]: Without dead ends: 733 [2021-03-10 17:25:28,745 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 243.3ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:25:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-03-10 17:25:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2021-03-10 17:25:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 2.5) internal successors, (1830), 732 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1830 transitions. [2021-03-10 17:25:28,756 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1830 transitions. Word has length 59 [2021-03-10 17:25:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:28,756 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1830 transitions. [2021-03-10 17:25:28,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1830 transitions. [2021-03-10 17:25:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:25:28,757 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:28,757 INFO L519 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] [2021-03-10 17:25:28,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:25:28,757 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1367695782, now seen corresponding path program 2 times [2021-03-10 17:25:28,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:28,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881234210] [2021-03-10 17:25:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:28,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881234210] [2021-03-10 17:25:28,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:28,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:25:28,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624601162] [2021-03-10 17:25:28,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:25:28,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:25:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:25:28,985 INFO L87 Difference]: Start difference. First operand 733 states and 1830 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:29,494 INFO L93 Difference]: Finished difference Result 841 states and 2082 transitions. [2021-03-10 17:25:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 17:25:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-03-10 17:25:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:29,497 INFO L225 Difference]: With dead ends: 841 [2021-03-10 17:25:29,497 INFO L226 Difference]: Without dead ends: 721 [2021-03-10 17:25:29,497 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 389.6ms TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-03-10 17:25:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-03-10 17:25:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 707. [2021-03-10 17:25:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 2.502832861189802) internal successors, (1767), 706 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1767 transitions. [2021-03-10 17:25:29,507 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1767 transitions. Word has length 59 [2021-03-10 17:25:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:29,507 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 1767 transitions. [2021-03-10 17:25:29,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1767 transitions. [2021-03-10 17:25:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-03-10 17:25:29,508 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:29,508 INFO L519 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] [2021-03-10 17:25:29,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:25:29,508 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1418417453, now seen corresponding path program 1 times [2021-03-10 17:25:29,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:29,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105095667] [2021-03-10 17:25:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:29,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105095667] [2021-03-10 17:25:29,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:29,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:25:29,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198531340] [2021-03-10 17:25:29,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:25:29,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:29,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:25:29,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:25:29,614 INFO L87 Difference]: Start difference. First operand 707 states and 1767 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:29,679 INFO L93 Difference]: Finished difference Result 775 states and 1881 transitions. [2021-03-10 17:25:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:25:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-03-10 17:25:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:29,681 INFO L225 Difference]: With dead ends: 775 [2021-03-10 17:25:29,681 INFO L226 Difference]: Without dead ends: 527 [2021-03-10 17:25:29,681 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:25:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-03-10 17:25:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2021-03-10 17:25:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 2.3669201520912546) internal successors, (1245), 526 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1245 transitions. [2021-03-10 17:25:29,690 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1245 transitions. Word has length 60 [2021-03-10 17:25:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:29,690 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 1245 transitions. [2021-03-10 17:25:29,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1245 transitions. [2021-03-10 17:25:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:25:29,691 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:29,691 INFO L519 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] [2021-03-10 17:25:29,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:25:29,691 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash -911883563, now seen corresponding path program 1 times [2021-03-10 17:25:29,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:29,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229325102] [2021-03-10 17:25:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:29,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229325102] [2021-03-10 17:25:29,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:29,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:25:29,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013215784] [2021-03-10 17:25:29,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:25:29,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:29,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:25:29,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:25:29,797 INFO L87 Difference]: Start difference. First operand 527 states and 1245 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:29,877 INFO L93 Difference]: Finished difference Result 419 states and 936 transitions. [2021-03-10 17:25:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:25:29,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-03-10 17:25:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:29,878 INFO L225 Difference]: With dead ends: 419 [2021-03-10 17:25:29,878 INFO L226 Difference]: Without dead ends: 275 [2021-03-10 17:25:29,879 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:25:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-03-10 17:25:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-03-10 17:25:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.091240875912409) internal successors, (573), 274 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 573 transitions. [2021-03-10 17:25:29,885 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 573 transitions. Word has length 61 [2021-03-10 17:25:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:29,885 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 573 transitions. [2021-03-10 17:25:29,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 573 transitions. [2021-03-10 17:25:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:25:29,886 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:29,886 INFO L519 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] [2021-03-10 17:25:29,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:25:29,886 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1508820576, now seen corresponding path program 1 times [2021-03-10 17:25:29,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:29,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203485460] [2021-03-10 17:25:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:25:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:25:30,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203485460] [2021-03-10 17:25:30,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:25:30,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:25:30,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957567586] [2021-03-10 17:25:30,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:25:30,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:25:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:25:30,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:25:30,072 INFO L87 Difference]: Start difference. First operand 275 states and 573 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:25:30,232 INFO L93 Difference]: Finished difference Result 405 states and 865 transitions. [2021-03-10 17:25:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:25:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-03-10 17:25:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:25:30,233 INFO L225 Difference]: With dead ends: 405 [2021-03-10 17:25:30,233 INFO L226 Difference]: Without dead ends: 251 [2021-03-10 17:25:30,234 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 171.2ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:25:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-03-10 17:25:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-03-10 17:25:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.052) internal successors, (513), 250 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 513 transitions. [2021-03-10 17:25:30,237 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 513 transitions. Word has length 64 [2021-03-10 17:25:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:25:30,238 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 513 transitions. [2021-03-10 17:25:30,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:25:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 513 transitions. [2021-03-10 17:25:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:25:30,238 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:25:30,238 INFO L519 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] [2021-03-10 17:25:30,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:25:30,238 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:25:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:25:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 608249440, now seen corresponding path program 2 times [2021-03-10 17:25:30,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:25:30,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865633625] [2021-03-10 17:25:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:25:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:25:30,259 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:25:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:25:30,285 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:25:30,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:25:30,323 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:25:30,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:25:30,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:25:30 BasicIcfg [2021-03-10 17:25:30,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:25:30,403 INFO L168 Benchmark]: Toolchain (without parser) took 5083.09 ms. Allocated memory was 255.9 MB in the beginning and 423.6 MB in the end (delta: 167.8 MB). Free memory was 234.9 MB in the beginning and 183.7 MB in the end (delta: 51.1 MB). Peak memory consumption was 217.4 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,403 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:25:30,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.99 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.2 MB in the beginning and 305.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.70 ms. Allocated memory is still 346.0 MB. Free memory was 305.8 MB in the beginning and 303.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,404 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 346.0 MB. Free memory was 303.0 MB in the beginning and 300.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,404 INFO L168 Benchmark]: RCFGBuilder took 1220.88 ms. Allocated memory is still 346.0 MB. Free memory was 300.9 MB in the beginning and 234.1 MB in the end (delta: 66.7 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,404 INFO L168 Benchmark]: TraceAbstraction took 3402.58 ms. Allocated memory was 346.0 MB in the beginning and 423.6 MB in the end (delta: 77.6 MB). Free memory was 233.1 MB in the beginning and 183.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 125.9 MB. Max. memory is 16.0 GB. [2021-03-10 17:25:30,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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 352.99 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.2 MB in the beginning and 305.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.70 ms. Allocated memory is still 346.0 MB. Free memory was 305.8 MB in the beginning and 303.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 346.0 MB. Free memory was 303.0 MB in the beginning and 300.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1220.88 ms. Allocated memory is still 346.0 MB. Free memory was 300.9 MB in the beginning and 234.1 MB in the end (delta: 66.7 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3402.58 ms. Allocated memory was 346.0 MB in the beginning and 423.6 MB in the end (delta: 77.6 MB). Free memory was 233.1 MB in the beginning and 183.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 125.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 0 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3247.0ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 28.1ms, AutomataDifference: 1553.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 69.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 816 SDtfs, 1113 SDslu, 2821 SDs, 0 SdLazy, 567 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 456.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1206.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2179occurred in iteration=0, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 155.4ms AutomataMinimizationTime, 9 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.3ms SsaConstructionTime, 302.6ms SatisfiabilityAnalysisTime, 910.5ms InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 2593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! Received shutdown request...