/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 00:11:52,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 00:11:52,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 00:11:52,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 00:11:52,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 00:11:52,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 00:11:52,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 00:11:52,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 00:11:52,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 00:11:52,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 00:11:52,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 00:11:52,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 00:11:52,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 00:11:52,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 00:11:52,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 00:11:52,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 00:11:52,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 00:11:52,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 00:11:52,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 00:11:52,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 00:11:52,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 00:11:52,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 00:11:52,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 00:11:52,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 00:11:52,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 00:11:52,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 00:11:52,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 00:11:52,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 00:11:52,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 00:11:52,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 00:11:52,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 00:11:52,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 00:11:52,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 00:11:52,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 00:11:52,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 00:11:52,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 00:11:52,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 00:11:52,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 00:11:52,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 00:11:52,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 00:11:52,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 00:11:52,881 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-06-05 00:11:52,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 00:11:52,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 00:11:52,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 00:11:52,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 00:11:52,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 00:11:52,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 00:11:52,918 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 00:11:52,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 00:11:52,919 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 00:11:52,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 00:11:52,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 00:11:52,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 00:11:52,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 00:11:52,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 00:11:52,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 00:11:52,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 00:11:52,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 00:11:52,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 00:11:52,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 00:11:52,922 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 00:11:52,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 00:11:52,923 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-06-05 00:11:53,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 00:11:53,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 00:11:53,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 00:11:53,228 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 00:11:53,228 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 00:11:53,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-05 00:11:53,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2f9b4b9/e8f9068e612e45e88ad8ff658f8e7a4b/FLAG98ca150da [2021-06-05 00:11:53,800 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 00:11:53,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-05 00:11:53,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2f9b4b9/e8f9068e612e45e88ad8ff658f8e7a4b/FLAG98ca150da [2021-06-05 00:11:54,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2f9b4b9/e8f9068e612e45e88ad8ff658f8e7a4b [2021-06-05 00:11:54,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 00:11:54,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 00:11:54,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 00:11:54,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 00:11:54,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 00:11:54,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e29592a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54, skipping insertion in model container [2021-06-05 00:11:54,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 00:11:54,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 00:11:54,331 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-05 00:11:54,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:11:54,499 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 00:11:54,508 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-05 00:11:54,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:11:54,597 INFO L208 MainTranslator]: Completed translation [2021-06-05 00:11:54,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54 WrapperNode [2021-06-05 00:11:54,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 00:11:54,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 00:11:54,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 00:11:54,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 00:11:54,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 00:11:54,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 00:11:54,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 00:11:54,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 00:11:54,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (1/1) ... [2021-06-05 00:11:54,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 00:11:54,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 00:11:54,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 00:11:54,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 00:11:54,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (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-06-05 00:11:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 00:11:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 00:11:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 00:11:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 00:11:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 00:11:54,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 00:11:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 00:11:54,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 00:11:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 00:11:54,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 00:11:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 00:11:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 00:11:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 00:11:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 00:11:54,764 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 00:11:56,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 00:11:56,664 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 00:11:56,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:11:56 BoogieIcfgContainer [2021-06-05 00:11:56,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 00:11:56,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 00:11:56,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 00:11:56,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 00:11:56,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:11:54" (1/3) ... [2021-06-05 00:11:56,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:11:56, skipping insertion in model container [2021-06-05 00:11:56,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:54" (2/3) ... [2021-06-05 00:11:56,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:11:56, skipping insertion in model container [2021-06-05 00:11:56,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:11:56" (3/3) ... [2021-06-05 00:11:56,672 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2021-06-05 00:11:56,677 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 00:11:56,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 00:11:56,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 00:11:56,678 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 00:11:56,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,706 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,706 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:11:56,727 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 00:11:56,745 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 00:11:56,760 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 00:11:56,760 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 00:11:56,761 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 00:11:56,761 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 00:11:56,761 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 00:11:56,761 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 00:11:56,761 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 00:11:56,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 00:11:56,770 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-05 00:11:57,598 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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-06-05 00:11:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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-06-05 00:11:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 00:11:57,637 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:11:57,637 INFO L521 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-06-05 00:11:57,638 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:11:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:11:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1091169302, now seen corresponding path program 1 times [2021-06-05 00:11:57,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:11:57,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729384476] [2021-06-05 00:11:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:11:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:11:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:11:57,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:11:57,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729384476] [2021-06-05 00:11:57,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729384476] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:11:57,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:11:57,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 00:11:57,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565270259] [2021-06-05 00:11:57,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 00:11:57,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:11:57,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 00:11:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:11:57,971 INFO L87 Difference]: Start difference. First operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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-06-05 00:11:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:11:58,212 INFO L93 Difference]: Finished difference Result 13855 states and 49120 transitions. [2021-06-05 00:11:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 00:11:58,214 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-06-05 00:11:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:11:58,281 INFO L225 Difference]: With dead ends: 13855 [2021-06-05 00:11:58,282 INFO L226 Difference]: Without dead ends: 8223 [2021-06-05 00:11:58,283 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:11:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-06-05 00:11:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2021-06-05 00:11:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 3.4911213816589637) internal successors, (28704), 8222 states have internal predecessors, (28704), 0 states have call successors, (0), 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-06-05 00:11:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 28704 transitions. [2021-06-05 00:11:58,769 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 28704 transitions. Word has length 41 [2021-06-05 00:11:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:11:58,770 INFO L482 AbstractCegarLoop]: Abstraction has 8223 states and 28704 transitions. [2021-06-05 00:11:58,770 INFO L483 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-06-05 00:11:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 28704 transitions. [2021-06-05 00:11:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 00:11:58,789 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:11:58,789 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:11:58,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 00:11:58,789 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:11:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:11:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1685543287, now seen corresponding path program 1 times [2021-06-05 00:11:58,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:11:58,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473214697] [2021-06-05 00:11:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:11:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:11:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:11:59,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:11:59,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473214697] [2021-06-05 00:11:59,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473214697] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:11:59,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:11:59,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:11:59,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154102595] [2021-06-05 00:11:59,128 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:11:59,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:11:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:11:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:11:59,129 INFO L87 Difference]: Start difference. First operand 8223 states and 28704 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-06-05 00:11:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:11:59,348 INFO L93 Difference]: Finished difference Result 9983 states and 34548 transitions. [2021-06-05 00:11:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:11:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-06-05 00:11:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:11:59,409 INFO L225 Difference]: With dead ends: 9983 [2021-06-05 00:11:59,410 INFO L226 Difference]: Without dead ends: 7935 [2021-06-05 00:11:59,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 123.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:11:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2021-06-05 00:11:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7935. [2021-06-05 00:11:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7935 states, 7934 states have (on average 3.4771867910259644) internal successors, (27588), 7934 states have internal predecessors, (27588), 0 states have call successors, (0), 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-06-05 00:11:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 27588 transitions. [2021-06-05 00:11:59,720 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 27588 transitions. Word has length 67 [2021-06-05 00:11:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:11:59,721 INFO L482 AbstractCegarLoop]: Abstraction has 7935 states and 27588 transitions. [2021-06-05 00:11:59,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-06-05 00:11:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 27588 transitions. [2021-06-05 00:11:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 00:11:59,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:11:59,735 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:11:59,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 00:11:59,735 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:11:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:11:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 715036136, now seen corresponding path program 1 times [2021-06-05 00:11:59,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:11:59,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795171422] [2021-06-05 00:11:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:11:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:11:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:11:59,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:11:59,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795171422] [2021-06-05 00:11:59,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795171422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:11:59,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:11:59,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:11:59,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983935594] [2021-06-05 00:11:59,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:11:59,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:11:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:11:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:11:59,859 INFO L87 Difference]: Start difference. First operand 7935 states and 27588 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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-06-05 00:12:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:00,097 INFO L93 Difference]: Finished difference Result 9095 states and 31328 transitions. [2021-06-05 00:12:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:12:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-06-05 00:12:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:00,150 INFO L225 Difference]: With dead ends: 9095 [2021-06-05 00:12:00,150 INFO L226 Difference]: Without dead ends: 7239 [2021-06-05 00:12:00,151 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:12:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2021-06-05 00:12:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 7239. [2021-06-05 00:12:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7239 states, 7238 states have (on average 3.453440176844432) internal successors, (24996), 7238 states have internal predecessors, (24996), 0 states have call successors, (0), 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-06-05 00:12:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7239 states to 7239 states and 24996 transitions. [2021-06-05 00:12:00,484 INFO L78 Accepts]: Start accepts. Automaton has 7239 states and 24996 transitions. Word has length 69 [2021-06-05 00:12:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:00,485 INFO L482 AbstractCegarLoop]: Abstraction has 7239 states and 24996 transitions. [2021-06-05 00:12:00,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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-06-05 00:12:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7239 states and 24996 transitions. [2021-06-05 00:12:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 00:12:00,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:00,499 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:00,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 00:12:00,500 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1248901623, now seen corresponding path program 1 times [2021-06-05 00:12:00,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:00,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097255912] [2021-06-05 00:12:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:00,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:00,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097255912] [2021-06-05 00:12:00,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097255912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:00,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:00,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:12:00,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809042917] [2021-06-05 00:12:00,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:12:00,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:12:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:12:00,667 INFO L87 Difference]: Start difference. First operand 7239 states and 24996 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:00,874 INFO L93 Difference]: Finished difference Result 10143 states and 34910 transitions. [2021-06-05 00:12:00,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:12:00,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 00:12:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:00,896 INFO L225 Difference]: With dead ends: 10143 [2021-06-05 00:12:00,896 INFO L226 Difference]: Without dead ends: 5295 [2021-06-05 00:12:00,897 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 129.2ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:12:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-06-05 00:12:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5295. [2021-06-05 00:12:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 5294 states have (on average 3.3513411409142426) internal successors, (17742), 5294 states have internal predecessors, (17742), 0 states have call successors, (0), 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-06-05 00:12:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 17742 transitions. [2021-06-05 00:12:01,127 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 17742 transitions. Word has length 71 [2021-06-05 00:12:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:01,127 INFO L482 AbstractCegarLoop]: Abstraction has 5295 states and 17742 transitions. [2021-06-05 00:12:01,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 17742 transitions. [2021-06-05 00:12:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 00:12:01,144 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:01,145 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:01,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 00:12:01,145 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -237206411, now seen corresponding path program 1 times [2021-06-05 00:12:01,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:01,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868308700] [2021-06-05 00:12:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:01,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:01,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868308700] [2021-06-05 00:12:01,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868308700] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:01,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:01,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:12:01,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055188726] [2021-06-05 00:12:01,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:12:01,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:01,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:12:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:12:01,426 INFO L87 Difference]: Start difference. First operand 5295 states and 17742 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-05 00:12:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:01,774 INFO L93 Difference]: Finished difference Result 6231 states and 20778 transitions. [2021-06-05 00:12:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 00:12:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-06-05 00:12:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:01,797 INFO L225 Difference]: With dead ends: 6231 [2021-06-05 00:12:01,797 INFO L226 Difference]: Without dead ends: 5271 [2021-06-05 00:12:01,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 216.8ms TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:12:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2021-06-05 00:12:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 5271. [2021-06-05 00:12:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 5270 states have (on average 3.3483870967741933) internal successors, (17646), 5270 states have internal predecessors, (17646), 0 states have call successors, (0), 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-06-05 00:12:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 17646 transitions. [2021-06-05 00:12:02,013 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 17646 transitions. Word has length 72 [2021-06-05 00:12:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:02,013 INFO L482 AbstractCegarLoop]: Abstraction has 5271 states and 17646 transitions. [2021-06-05 00:12:02,014 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-05 00:12:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 17646 transitions. [2021-06-05 00:12:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 00:12:02,024 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:02,024 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:02,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 00:12:02,024 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1067583572, now seen corresponding path program 1 times [2021-06-05 00:12:02,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:02,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38063672] [2021-06-05 00:12:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:02,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:02,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38063672] [2021-06-05 00:12:02,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38063672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:02,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:02,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:12:02,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401514941] [2021-06-05 00:12:02,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:12:02,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:02,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:12:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:12:02,182 INFO L87 Difference]: Start difference. First operand 5271 states and 17646 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:02,585 INFO L93 Difference]: Finished difference Result 6211 states and 20734 transitions. [2021-06-05 00:12:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 00:12:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 00:12:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:02,603 INFO L225 Difference]: With dead ends: 6211 [2021-06-05 00:12:02,603 INFO L226 Difference]: Without dead ends: 5379 [2021-06-05 00:12:02,604 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 220.4ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:12:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2021-06-05 00:12:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 5331. [2021-06-05 00:12:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5330 states have (on average 3.350844277673546) internal successors, (17860), 5330 states have internal predecessors, (17860), 0 states have call successors, (0), 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-06-05 00:12:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 17860 transitions. [2021-06-05 00:12:02,744 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 17860 transitions. Word has length 73 [2021-06-05 00:12:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:02,745 INFO L482 AbstractCegarLoop]: Abstraction has 5331 states and 17860 transitions. [2021-06-05 00:12:02,745 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 17860 transitions. [2021-06-05 00:12:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 00:12:02,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:02,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:02,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 00:12:02,816 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 326345816, now seen corresponding path program 1 times [2021-06-05 00:12:02,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:02,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781259512] [2021-06-05 00:12:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:03,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:03,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781259512] [2021-06-05 00:12:03,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781259512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:03,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:03,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 00:12:03,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440174253] [2021-06-05 00:12:03,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 00:12:03,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:03,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 00:12:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:12:03,134 INFO L87 Difference]: Start difference. First operand 5331 states and 17860 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:03,525 INFO L93 Difference]: Finished difference Result 6341 states and 21148 transitions. [2021-06-05 00:12:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 00:12:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 00:12:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:03,541 INFO L225 Difference]: With dead ends: 6341 [2021-06-05 00:12:03,541 INFO L226 Difference]: Without dead ends: 5573 [2021-06-05 00:12:03,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 335.0ms TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-06-05 00:12:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2021-06-05 00:12:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5283. [2021-06-05 00:12:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 5282 states have (on average 3.347216963271488) internal successors, (17680), 5282 states have internal predecessors, (17680), 0 states have call successors, (0), 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-06-05 00:12:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 17680 transitions. [2021-06-05 00:12:03,690 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 17680 transitions. Word has length 73 [2021-06-05 00:12:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:03,690 INFO L482 AbstractCegarLoop]: Abstraction has 5283 states and 17680 transitions. [2021-06-05 00:12:03,691 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 17680 transitions. [2021-06-05 00:12:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 00:12:03,700 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:03,701 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:03,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 00:12:03,701 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash 468080022, now seen corresponding path program 1 times [2021-06-05 00:12:03,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:03,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034695402] [2021-06-05 00:12:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:03,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:03,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034695402] [2021-06-05 00:12:03,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034695402] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:03,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:03,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 00:12:03,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157282613] [2021-06-05 00:12:03,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 00:12:03,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 00:12:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:12:03,978 INFO L87 Difference]: Start difference. First operand 5283 states and 17680 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 00:12:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:04,375 INFO L93 Difference]: Finished difference Result 6291 states and 20964 transitions. [2021-06-05 00:12:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 00:12:04,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-05 00:12:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:04,389 INFO L225 Difference]: With dead ends: 6291 [2021-06-05 00:12:04,389 INFO L226 Difference]: Without dead ends: 5523 [2021-06-05 00:12:04,389 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 273.6ms TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-06-05 00:12:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2021-06-05 00:12:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5523. [2021-06-05 00:12:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 3.345889170590366) internal successors, (18476), 5522 states have internal predecessors, (18476), 0 states have call successors, (0), 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-06-05 00:12:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 18476 transitions. [2021-06-05 00:12:04,521 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 18476 transitions. Word has length 74 [2021-06-05 00:12:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:04,521 INFO L482 AbstractCegarLoop]: Abstraction has 5523 states and 18476 transitions. [2021-06-05 00:12:04,522 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 00:12:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 18476 transitions. [2021-06-05 00:12:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 00:12:04,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:04,531 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:04,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 00:12:04,532 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash 354457601, now seen corresponding path program 1 times [2021-06-05 00:12:04,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:04,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304208272] [2021-06-05 00:12:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:04,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:04,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304208272] [2021-06-05 00:12:04,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304208272] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:04,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:04,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 00:12:04,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224634251] [2021-06-05 00:12:04,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 00:12:04,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 00:12:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 00:12:04,767 INFO L87 Difference]: Start difference. First operand 5523 states and 18476 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 00:12:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:05,307 INFO L93 Difference]: Finished difference Result 6755 states and 22559 transitions. [2021-06-05 00:12:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:12:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-05 00:12:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:05,321 INFO L225 Difference]: With dead ends: 6755 [2021-06-05 00:12:05,321 INFO L226 Difference]: Without dead ends: 5883 [2021-06-05 00:12:05,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 410.6ms TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2021-06-05 00:12:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2021-06-05 00:12:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5715. [2021-06-05 00:12:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5715 states, 5714 states have (on average 3.347742387119356) internal successors, (19129), 5714 states have internal predecessors, (19129), 0 states have call successors, (0), 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-06-05 00:12:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 19129 transitions. [2021-06-05 00:12:05,447 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 19129 transitions. Word has length 74 [2021-06-05 00:12:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:05,447 INFO L482 AbstractCegarLoop]: Abstraction has 5715 states and 19129 transitions. [2021-06-05 00:12:05,448 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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-06-05 00:12:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 19129 transitions. [2021-06-05 00:12:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 00:12:05,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:05,458 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:05,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 00:12:05,459 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1588688614, now seen corresponding path program 1 times [2021-06-05 00:12:05,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:05,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945978299] [2021-06-05 00:12:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:05,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:05,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945978299] [2021-06-05 00:12:05,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945978299] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:05,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:05,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 00:12:05,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587956273] [2021-06-05 00:12:05,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 00:12:05,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:05,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 00:12:05,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:12:05,778 INFO L87 Difference]: Start difference. First operand 5715 states and 19129 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:06,143 INFO L93 Difference]: Finished difference Result 6243 states and 20781 transitions. [2021-06-05 00:12:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 00:12:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 00:12:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:06,154 INFO L225 Difference]: With dead ends: 6243 [2021-06-05 00:12:06,154 INFO L226 Difference]: Without dead ends: 5667 [2021-06-05 00:12:06,155 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 360.9ms TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-06-05 00:12:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5667 states. [2021-06-05 00:12:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5667 to 5667. [2021-06-05 00:12:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5667 states, 5666 states have (on average 3.3443346276032475) internal successors, (18949), 5666 states have internal predecessors, (18949), 0 states have call successors, (0), 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-06-05 00:12:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 18949 transitions. [2021-06-05 00:12:06,304 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 18949 transitions. Word has length 75 [2021-06-05 00:12:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:06,305 INFO L482 AbstractCegarLoop]: Abstraction has 5667 states and 18949 transitions. [2021-06-05 00:12:06,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 18949 transitions. [2021-06-05 00:12:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 00:12:06,316 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:06,317 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:06,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 00:12:06,317 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 715388759, now seen corresponding path program 1 times [2021-06-05 00:12:06,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:06,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455629532] [2021-06-05 00:12:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:06,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:06,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455629532] [2021-06-05 00:12:06,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455629532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:06,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:06,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 00:12:06,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314154452] [2021-06-05 00:12:06,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 00:12:06,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 00:12:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:12:06,634 INFO L87 Difference]: Start difference. First operand 5667 states and 18949 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:06,946 INFO L93 Difference]: Finished difference Result 5987 states and 19909 transitions. [2021-06-05 00:12:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 00:12:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 00:12:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:06,958 INFO L225 Difference]: With dead ends: 5987 [2021-06-05 00:12:06,959 INFO L226 Difference]: Without dead ends: 5475 [2021-06-05 00:12:06,959 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 351.6ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-06-05 00:12:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2021-06-05 00:12:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5115. [2021-06-05 00:12:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 5114 states have (on average 3.331834180680485) internal successors, (17039), 5114 states have internal predecessors, (17039), 0 states have call successors, (0), 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-06-05 00:12:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 17039 transitions. [2021-06-05 00:12:07,103 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 17039 transitions. Word has length 75 [2021-06-05 00:12:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:07,104 INFO L482 AbstractCegarLoop]: Abstraction has 5115 states and 17039 transitions. [2021-06-05 00:12:07,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 17039 transitions. [2021-06-05 00:12:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 00:12:07,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:07,114 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:07,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 00:12:07,115 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 838493874, now seen corresponding path program 1 times [2021-06-05 00:12:07,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:07,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384680965] [2021-06-05 00:12:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:07,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:07,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384680965] [2021-06-05 00:12:07,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384680965] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:07,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:07,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:12:07,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329701253] [2021-06-05 00:12:07,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:12:07,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:12:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:12:07,204 INFO L87 Difference]: Start difference. First operand 5115 states and 17039 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:07,329 INFO L93 Difference]: Finished difference Result 6123 states and 20109 transitions. [2021-06-05 00:12:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:12:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 00:12:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:07,340 INFO L225 Difference]: With dead ends: 6123 [2021-06-05 00:12:07,340 INFO L226 Difference]: Without dead ends: 4539 [2021-06-05 00:12:07,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:12:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2021-06-05 00:12:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4539. [2021-06-05 00:12:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4539 states, 4538 states have (on average 3.266857646540326) internal successors, (14825), 4538 states have internal predecessors, (14825), 0 states have call successors, (0), 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-06-05 00:12:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 14825 transitions. [2021-06-05 00:12:07,451 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 14825 transitions. Word has length 76 [2021-06-05 00:12:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:07,451 INFO L482 AbstractCegarLoop]: Abstraction has 4539 states and 14825 transitions. [2021-06-05 00:12:07,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 14825 transitions. [2021-06-05 00:12:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 00:12:07,461 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:07,461 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:07,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 00:12:07,461 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -902903539, now seen corresponding path program 1 times [2021-06-05 00:12:07,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:07,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519452470] [2021-06-05 00:12:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:07,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:07,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519452470] [2021-06-05 00:12:07,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519452470] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:07,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:07,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:12:07,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112199618] [2021-06-05 00:12:07,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:12:07,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:12:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:12:07,555 INFO L87 Difference]: Start difference. First operand 4539 states and 14825 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:07,694 INFO L93 Difference]: Finished difference Result 4437 states and 14097 transitions. [2021-06-05 00:12:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:12:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 00:12:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:07,702 INFO L225 Difference]: With dead ends: 4437 [2021-06-05 00:12:07,702 INFO L226 Difference]: Without dead ends: 3189 [2021-06-05 00:12:07,702 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 101.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:12:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2021-06-05 00:12:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3153. [2021-06-05 00:12:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3152 states have (on average 3.111040609137056) internal successors, (9806), 3152 states have internal predecessors, (9806), 0 states have call successors, (0), 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-06-05 00:12:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 9806 transitions. [2021-06-05 00:12:07,775 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 9806 transitions. Word has length 77 [2021-06-05 00:12:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:07,775 INFO L482 AbstractCegarLoop]: Abstraction has 3153 states and 9806 transitions. [2021-06-05 00:12:07,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 9806 transitions. [2021-06-05 00:12:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 00:12:07,782 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:07,782 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:07,782 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 00:12:07,782 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1895442222, now seen corresponding path program 1 times [2021-06-05 00:12:07,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:07,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608659983] [2021-06-05 00:12:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:07,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:07,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608659983] [2021-06-05 00:12:07,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608659983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:07,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:07,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 00:12:07,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100772759] [2021-06-05 00:12:07,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 00:12:07,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 00:12:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 00:12:07,903 INFO L87 Difference]: Start difference. First operand 3153 states and 9806 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:08,061 INFO L93 Difference]: Finished difference Result 2595 states and 7883 transitions. [2021-06-05 00:12:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:12:08,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 00:12:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:08,065 INFO L225 Difference]: With dead ends: 2595 [2021-06-05 00:12:08,065 INFO L226 Difference]: Without dead ends: 2019 [2021-06-05 00:12:08,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 124.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:12:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2021-06-05 00:12:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1971. [2021-06-05 00:12:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1970 states have (on average 2.981725888324873) internal successors, (5874), 1970 states have internal predecessors, (5874), 0 states have call successors, (0), 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-06-05 00:12:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 5874 transitions. [2021-06-05 00:12:08,107 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 5874 transitions. Word has length 79 [2021-06-05 00:12:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:08,107 INFO L482 AbstractCegarLoop]: Abstraction has 1971 states and 5874 transitions. [2021-06-05 00:12:08,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 5874 transitions. [2021-06-05 00:12:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 00:12:08,111 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:08,112 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:08,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 00:12:08,112 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -575909962, now seen corresponding path program 1 times [2021-06-05 00:12:08,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:08,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739100347] [2021-06-05 00:12:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:12:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:12:08,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:12:08,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739100347] [2021-06-05 00:12:08,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739100347] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:12:08,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:12:08,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 00:12:08,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786663214] [2021-06-05 00:12:08,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 00:12:08,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:12:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 00:12:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-06-05 00:12:08,572 INFO L87 Difference]: Start difference. First operand 1971 states and 5874 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:12:08,994 INFO L93 Difference]: Finished difference Result 2691 states and 8079 transitions. [2021-06-05 00:12:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:12:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 00:12:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:12:08,997 INFO L225 Difference]: With dead ends: 2691 [2021-06-05 00:12:08,998 INFO L226 Difference]: Without dead ends: 1617 [2021-06-05 00:12:08,998 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 512.3ms TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-06-05 00:12:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-06-05 00:12:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1467. [2021-06-05 00:12:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 2.9481582537517053) internal successors, (4322), 1466 states have internal predecessors, (4322), 0 states have call successors, (0), 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-06-05 00:12:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4322 transitions. [2021-06-05 00:12:09,027 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4322 transitions. Word has length 82 [2021-06-05 00:12:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:12:09,027 INFO L482 AbstractCegarLoop]: Abstraction has 1467 states and 4322 transitions. [2021-06-05 00:12:09,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:12:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4322 transitions. [2021-06-05 00:12:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 00:12:09,030 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:12:09,030 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:12:09,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 00:12:09,031 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:12:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:12:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2009377846, now seen corresponding path program 2 times [2021-06-05 00:12:09,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:12:09,031 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060876494] [2021-06-05 00:12:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:12:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:12:09,079 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:12:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:12:09,138 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:12:09,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 00:12:09,190 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 00:12:09,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 00:12:09,193 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 00:12:09,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:12:09 BasicIcfg [2021-06-05 00:12:09,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 00:12:09,348 INFO L168 Benchmark]: Toolchain (without parser) took 15249.47 ms. Allocated memory was 350.2 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 312.8 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,348 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory was 331.0 MB in the beginning and 330.9 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 00:12:09,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.71 ms. Allocated memory is still 350.2 MB. Free memory was 312.6 MB in the beginning and 310.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 350.2 MB. Free memory was 310.0 MB in the beginning and 306.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,348 INFO L168 Benchmark]: Boogie Preprocessor took 30.91 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 304.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,351 INFO L168 Benchmark]: RCFGBuilder took 1969.72 ms. Allocated memory is still 350.2 MB. Free memory was 304.8 MB in the beginning and 269.5 MB in the end (delta: 35.2 MB). Peak memory consumption was 185.2 MB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,351 INFO L168 Benchmark]: TraceAbstraction took 12680.45 ms. Allocated memory was 350.2 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 269.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-06-05 00:12:09,355 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.15 ms. Allocated memory is still 350.2 MB. Free memory was 331.0 MB in the beginning and 330.9 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 496.71 ms. Allocated memory is still 350.2 MB. Free memory was 312.6 MB in the beginning and 310.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 350.2 MB. Free memory was 310.0 MB in the beginning and 306.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.91 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 304.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1969.72 ms. Allocated memory is still 350.2 MB. Free memory was 304.8 MB in the beginning and 269.5 MB in the end (delta: 35.2 MB). Peak memory consumption was 185.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12680.45 ms. Allocated memory was 350.2 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 269.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12432.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 253.0ms, AutomataDifference: 4906.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 837.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1941 SDtfs, 3960 SDslu, 8629 SDs, 0 SdLazy, 1437 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1422.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3346.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2653.3ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1100 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 65.2ms SsaConstructionTime, 564.2ms SatisfiabilityAnalysisTime, 2740.8ms InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1063 ConstructedInterpolants, 0 QuantifiedInterpolants, 8489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...