/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/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 00:13:55,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 00:13:55,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 00:13:55,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 00:13:55,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 00:13:55,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 00:13:55,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 00:13:55,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 00:13:55,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 00:13:55,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 00:13:55,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 00:13:55,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 00:13:55,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 00:13:55,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 00:13:55,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 00:13:55,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 00:13:55,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 00:13:55,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 00:13:55,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 00:13:55,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 00:13:55,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 00:13:55,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 00:13:55,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 00:13:55,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 00:13:55,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 00:13:55,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 00:13:55,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 00:13:55,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 00:13:55,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 00:13:55,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 00:13:55,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 00:13:55,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 00:13:55,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 00:13:55,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 00:13:55,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 00:13:55,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 00:13:55,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 00:13:55,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 00:13:55,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 00:13:55,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 00:13:55,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 00:13:55,776 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:13:55,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 00:13:55,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 00:13:55,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 00:13:55,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 00:13:55,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 00:13:55,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 00:13:55,824 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 00:13:55,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 00:13:55,824 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 00:13:55,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 00:13:55,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 00:13:55,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 00:13:55,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 00:13:55,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 00:13:55,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 00:13:55,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 00:13:55,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 00:13:55,828 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 00:13:55,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 00:13:55,828 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:13:56,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 00:13:56,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 00:13:56,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 00:13:56,140 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 00:13:56,140 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 00:13:56,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-06-05 00:13:56,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05eeb9ffe/13a3cd3f19d84d49b69a5d6abd14f8bf/FLAG1b3ee4edd [2021-06-05 00:13:56,696 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 00:13:56,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-06-05 00:13:56,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05eeb9ffe/13a3cd3f19d84d49b69a5d6abd14f8bf/FLAG1b3ee4edd [2021-06-05 00:13:57,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05eeb9ffe/13a3cd3f19d84d49b69a5d6abd14f8bf [2021-06-05 00:13:57,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 00:13:57,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 00:13:57,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 00:13:57,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 00:13:57,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 00:13:57,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eea3e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57, skipping insertion in model container [2021-06-05 00:13:57,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 00:13:57,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 00:13:57,413 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/safe017_rmo.opt.i[949,962] [2021-06-05 00:13:57,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:13:57,568 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 00:13:57,578 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/safe017_rmo.opt.i[949,962] [2021-06-05 00:13:57,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:13:57,691 INFO L208 MainTranslator]: Completed translation [2021-06-05 00:13:57,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57 WrapperNode [2021-06-05 00:13:57,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 00:13:57,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 00:13:57,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 00:13:57,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 00:13:57,699 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:13:57" (1/1) ... [2021-06-05 00:13:57,717 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:13:57" (1/1) ... [2021-06-05 00:13:57,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 00:13:57,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 00:13:57,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 00:13:57,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 00:13:57,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (1/1) ... [2021-06-05 00:13:57,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 00:13:57,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 00:13:57,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 00:13:57,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 00:13:57,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (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:13:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 00:13:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 00:13:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 00:13:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 00:13:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 00:13:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 00:13:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 00:13:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 00:13:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 00:13:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 00:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 00:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 00:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 00:13:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 00:13:57,903 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:13:59,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 00:13:59,972 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 00:13:59,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:13:59 BoogieIcfgContainer [2021-06-05 00:13:59,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 00:13:59,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 00:13:59,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 00:13:59,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 00:13:59,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:13:57" (1/3) ... [2021-06-05 00:13:59,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee92d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:13:59, skipping insertion in model container [2021-06-05 00:13:59,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:13:57" (2/3) ... [2021-06-05 00:13:59,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee92d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:13:59, skipping insertion in model container [2021-06-05 00:13:59,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:13:59" (3/3) ... [2021-06-05 00:13:59,982 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-06-05 00:13:59,991 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 00:13:59,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 00:13:59,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 00:13:59,992 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 00:14:00,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:14:00,052 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 00:14:00,071 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 00:14:00,087 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 00:14:00,087 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 00:14:00,087 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 00:14:00,087 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 00:14:00,087 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 00:14:00,088 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 00:14:00,088 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 00:14:00,088 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 00:14:00,097 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-05 00:14:00,839 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 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:14:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 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:14:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 00:14:00,882 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:00,883 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] [2021-06-05 00:14:00,883 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -857883359, now seen corresponding path program 1 times [2021-06-05 00:14:00,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:00,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168350346] [2021-06-05 00:14:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:01,103 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:14:01,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:01,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168350346] [2021-06-05 00:14:01,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168350346] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:01,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:01,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 00:14:01,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604887913] [2021-06-05 00:14:01,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 00:14:01,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 00:14:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:14:01,155 INFO L87 Difference]: Start difference. First operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 0 states have call successors, (0), 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.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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:14:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:01,458 INFO L93 Difference]: Finished difference Result 12134 states and 42782 transitions. [2021-06-05 00:14:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 00:14:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-06-05 00:14:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:01,532 INFO L225 Difference]: With dead ends: 12134 [2021-06-05 00:14:01,532 INFO L226 Difference]: Without dead ends: 7206 [2021-06-05 00:14:01,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 00:14:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2021-06-05 00:14:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 7206. [2021-06-05 00:14:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 7205 states have (on average 3.470645385149202) internal successors, (25006), 7205 states have internal predecessors, (25006), 0 states have call successors, (0), 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:14:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 25006 transitions. [2021-06-05 00:14:01,976 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 25006 transitions. Word has length 40 [2021-06-05 00:14:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:01,976 INFO L482 AbstractCegarLoop]: Abstraction has 7206 states and 25006 transitions. [2021-06-05 00:14:01,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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:14:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 25006 transitions. [2021-06-05 00:14:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 00:14:01,992 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:01,993 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] [2021-06-05 00:14:01,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 00:14:01,993 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -247046329, now seen corresponding path program 1 times [2021-06-05 00:14:01,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:01,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027095860] [2021-06-05 00:14:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:02,290 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:14:02,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:02,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027095860] [2021-06-05 00:14:02,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027095860] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:02,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:02,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:14:02,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273311804] [2021-06-05 00:14:02,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:14:02,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:14:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:14:02,294 INFO L87 Difference]: Start difference. First operand 7206 states and 25006 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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:14:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:02,487 INFO L93 Difference]: Finished difference Result 8326 states and 28626 transitions. [2021-06-05 00:14:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:14:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-06-05 00:14:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:02,585 INFO L225 Difference]: With dead ends: 8326 [2021-06-05 00:14:02,585 INFO L226 Difference]: Without dead ends: 6534 [2021-06-05 00:14:02,586 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:14:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2021-06-05 00:14:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6534. [2021-06-05 00:14:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.44374712995561) internal successors, (22498), 6533 states have internal predecessors, (22498), 0 states have call successors, (0), 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:14:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 22498 transitions. [2021-06-05 00:14:02,886 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 22498 transitions. Word has length 66 [2021-06-05 00:14:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:02,887 INFO L482 AbstractCegarLoop]: Abstraction has 6534 states and 22498 transitions. [2021-06-05 00:14:02,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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:14:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 22498 transitions. [2021-06-05 00:14:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 00:14:02,903 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:02,903 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] [2021-06-05 00:14:02,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 00:14:02,903 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:02,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:02,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1410751468, now seen corresponding path program 1 times [2021-06-05 00:14:02,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:02,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606988292] [2021-06-05 00:14:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:03,084 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:14:03,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:03,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606988292] [2021-06-05 00:14:03,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606988292] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:03,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:03,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:14:03,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741803900] [2021-06-05 00:14:03,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:14:03,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:14:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:14:03,097 INFO L87 Difference]: Start difference. First operand 6534 states and 22498 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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:14:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:03,394 INFO L93 Difference]: Finished difference Result 10362 states and 35702 transitions. [2021-06-05 00:14:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:14:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-05 00:14:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:03,423 INFO L225 Difference]: With dead ends: 10362 [2021-06-05 00:14:03,424 INFO L226 Difference]: Without dead ends: 5994 [2021-06-05 00:14:03,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:14:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2021-06-05 00:14:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5994. [2021-06-05 00:14:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5993 states have (on average 3.405639913232104) internal successors, (20410), 5993 states have internal predecessors, (20410), 0 states have call successors, (0), 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:14:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 20410 transitions. [2021-06-05 00:14:03,689 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 20410 transitions. Word has length 68 [2021-06-05 00:14:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:03,690 INFO L482 AbstractCegarLoop]: Abstraction has 5994 states and 20410 transitions. [2021-06-05 00:14:03,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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:14:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 20410 transitions. [2021-06-05 00:14:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 00:14:03,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14: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] [2021-06-05 00:14:03,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 00:14:03,701 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1118791733, now seen corresponding path program 1 times [2021-06-05 00:14:03,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:03,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319728729] [2021-06-05 00:14:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:03,999 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:14:03,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:04,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319728729] [2021-06-05 00:14:04,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319728729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:04,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:04,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 00:14:04,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427801398] [2021-06-05 00:14:04,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 00:14:04,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 00:14:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:14:04,002 INFO L87 Difference]: Start difference. First operand 5994 states and 20410 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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:14:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:04,429 INFO L93 Difference]: Finished difference Result 7214 states and 24430 transitions. [2021-06-05 00:14:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 00:14:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-05 00:14:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:04,461 INFO L225 Difference]: With dead ends: 7214 [2021-06-05 00:14:04,461 INFO L226 Difference]: Without dead ends: 6222 [2021-06-05 00:14:04,462 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 279.5ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:14:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6222 states. [2021-06-05 00:14:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6222 to 5934. [2021-06-05 00:14:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5934 states, 5933 states have (on average 3.401651778189786) internal successors, (20182), 5933 states have internal predecessors, (20182), 0 states have call successors, (0), 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:14:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 20182 transitions. [2021-06-05 00:14:04,659 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 20182 transitions. Word has length 70 [2021-06-05 00:14:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:04,660 INFO L482 AbstractCegarLoop]: Abstraction has 5934 states and 20182 transitions. [2021-06-05 00:14:04,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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:14:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 20182 transitions. [2021-06-05 00:14:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 00:14:04,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:04,672 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:14:04,673 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 00:14:04,673 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash -661853219, now seen corresponding path program 1 times [2021-06-05 00:14:04,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:04,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648035474] [2021-06-05 00:14:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:04,786 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:14:04,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:04,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648035474] [2021-06-05 00:14:04,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648035474] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:04,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:04,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:14:04,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694919652] [2021-06-05 00:14:04,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:14:04,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:04,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:14:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:14:04,789 INFO L87 Difference]: Start difference. First operand 5934 states and 20182 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:14:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:05,117 INFO L93 Difference]: Finished difference Result 13189 states and 44346 transitions. [2021-06-05 00:14:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:14:05,118 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:14:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:05,141 INFO L225 Difference]: With dead ends: 13189 [2021-06-05 00:14:05,142 INFO L226 Difference]: Without dead ends: 5934 [2021-06-05 00:14:05,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 236.3ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:14:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2021-06-05 00:14:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5034. [2021-06-05 00:14:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 5033 states have (on average 3.275779852970395) internal successors, (16487), 5033 states have internal predecessors, (16487), 0 states have call successors, (0), 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:14:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 16487 transitions. [2021-06-05 00:14:05,296 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 16487 transitions. Word has length 71 [2021-06-05 00:14:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:05,297 INFO L482 AbstractCegarLoop]: Abstraction has 5034 states and 16487 transitions. [2021-06-05 00:14:05,297 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:14:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 16487 transitions. [2021-06-05 00:14:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 00:14:05,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:05,306 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:14:05,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 00:14:05,307 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1168582365, now seen corresponding path program 1 times [2021-06-05 00:14:05,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:05,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804385639] [2021-06-05 00:14:05,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:05,573 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:14:05,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:05,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804385639] [2021-06-05 00:14:05,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804385639] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:05,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:05,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 00:14:05,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503005461] [2021-06-05 00:14:05,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 00:14:05,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 00:14:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 00:14:05,575 INFO L87 Difference]: Start difference. First operand 5034 states and 16487 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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:14:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:05,941 INFO L93 Difference]: Finished difference Result 5940 states and 19457 transitions. [2021-06-05 00:14:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 00:14:05,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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:14:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:05,961 INFO L225 Difference]: With dead ends: 5940 [2021-06-05 00:14:05,961 INFO L226 Difference]: Without dead ends: 5108 [2021-06-05 00:14:05,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 308.6ms TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:14:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2021-06-05 00:14:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5044. [2021-06-05 00:14:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5044 states, 5043 states have (on average 3.2748364069006546) internal successors, (16515), 5043 states have internal predecessors, (16515), 0 states have call successors, (0), 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:14:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16515 transitions. [2021-06-05 00:14:06,088 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16515 transitions. Word has length 71 [2021-06-05 00:14:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:06,089 INFO L482 AbstractCegarLoop]: Abstraction has 5044 states and 16515 transitions. [2021-06-05 00:14:06,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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:14:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16515 transitions. [2021-06-05 00:14:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 00:14:06,098 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:06,098 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:14:06,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 00:14:06,099 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1935675461, now seen corresponding path program 2 times [2021-06-05 00:14:06,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:06,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378461962] [2021-06-05 00:14:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:06,313 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:14:06,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:06,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378461962] [2021-06-05 00:14:06,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378461962] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:06,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:06,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:14:06,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733968019] [2021-06-05 00:14:06,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:14:06,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:14:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:14:06,315 INFO L87 Difference]: Start difference. First operand 5044 states and 16515 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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:14:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:06,721 INFO L93 Difference]: Finished difference Result 5936 states and 19431 transitions. [2021-06-05 00:14:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 00:14:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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:14:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:06,738 INFO L225 Difference]: With dead ends: 5936 [2021-06-05 00:14:06,739 INFO L226 Difference]: Without dead ends: 5104 [2021-06-05 00:14:06,739 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 283.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:14:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2021-06-05 00:14:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5094. [2021-06-05 00:14:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5094 states, 5093 states have (on average 3.2792067543687415) internal successors, (16701), 5093 states have internal predecessors, (16701), 0 states have call successors, (0), 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:14:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5094 states to 5094 states and 16701 transitions. [2021-06-05 00:14:06,867 INFO L78 Accepts]: Start accepts. Automaton has 5094 states and 16701 transitions. Word has length 71 [2021-06-05 00:14:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:06,867 INFO L482 AbstractCegarLoop]: Abstraction has 5094 states and 16701 transitions. [2021-06-05 00:14:06,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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:14:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5094 states and 16701 transitions. [2021-06-05 00:14:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 00:14:06,878 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:06,878 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:14:06,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 00:14:06,878 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash -102679091, now seen corresponding path program 1 times [2021-06-05 00:14:06,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:06,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506164776] [2021-06-05 00:14:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:07,032 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:14:07,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:07,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506164776] [2021-06-05 00:14:07,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506164776] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:07,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:07,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:14:07,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591206383] [2021-06-05 00:14:07,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:14:07,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:14:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:14:07,034 INFO L87 Difference]: Start difference. First operand 5094 states and 16701 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:14:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:07,349 INFO L93 Difference]: Finished difference Result 5970 states and 19421 transitions. [2021-06-05 00:14:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 00:14:07,350 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:14:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:07,367 INFO L225 Difference]: With dead ends: 5970 [2021-06-05 00:14:07,367 INFO L226 Difference]: Without dead ends: 5218 [2021-06-05 00:14:07,368 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 236.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 00:14:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2021-06-05 00:14:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5218. [2021-06-05 00:14:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 5217 states have (on average 3.25608587310715) internal successors, (16987), 5217 states have internal predecessors, (16987), 0 states have call successors, (0), 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:14:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 16987 transitions. [2021-06-05 00:14:07,509 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 16987 transitions. Word has length 72 [2021-06-05 00:14:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:07,509 INFO L482 AbstractCegarLoop]: Abstraction has 5218 states and 16987 transitions. [2021-06-05 00:14:07,509 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:14:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 16987 transitions. [2021-06-05 00:14:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 00:14:07,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:07,524 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:14:07,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 00:14:07,524 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -49760948, now seen corresponding path program 1 times [2021-06-05 00:14:07,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:07,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757779634] [2021-06-05 00:14:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:07,718 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:14:07,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:07,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757779634] [2021-06-05 00:14:07,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757779634] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:07,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:07,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:14:07,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539225221] [2021-06-05 00:14:07,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:14:07,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:14:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:14:07,720 INFO L87 Difference]: Start difference. First operand 5218 states and 16987 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:14:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:08,097 INFO L93 Difference]: Finished difference Result 5708 states and 18495 transitions. [2021-06-05 00:14:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 00:14:08,098 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:14:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:08,114 INFO L225 Difference]: With dead ends: 5708 [2021-06-05 00:14:08,114 INFO L226 Difference]: Without dead ends: 4940 [2021-06-05 00:14:08,114 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 257.9ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:14:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2021-06-05 00:14:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4858. [2021-06-05 00:14:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 4857 states have (on average 3.23100679431748) internal successors, (15693), 4857 states have internal predecessors, (15693), 0 states have call successors, (0), 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:14:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 15693 transitions. [2021-06-05 00:14:08,246 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 15693 transitions. Word has length 72 [2021-06-05 00:14:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:08,247 INFO L482 AbstractCegarLoop]: Abstraction has 4858 states and 15693 transitions. [2021-06-05 00:14:08,247 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:14:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 15693 transitions. [2021-06-05 00:14:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 00:14:08,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:08,256 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:14:08,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 00:14:08,257 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash -485189295, now seen corresponding path program 1 times [2021-06-05 00:14:08,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:08,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133611281] [2021-06-05 00:14:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:08,505 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:14:08,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:08,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133611281] [2021-06-05 00:14:08,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133611281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:08,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:08,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 00:14:08,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049360792] [2021-06-05 00:14:08,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 00:14:08,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 00:14:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-05 00:14:08,507 INFO L87 Difference]: Start difference. First operand 4858 states and 15693 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:14:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:08,735 INFO L93 Difference]: Finished difference Result 5386 states and 17345 transitions. [2021-06-05 00:14:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:14:08,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:14:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:08,748 INFO L225 Difference]: With dead ends: 5386 [2021-06-05 00:14:08,748 INFO L226 Difference]: Without dead ends: 4810 [2021-06-05 00:14:08,749 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 213.6ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:14:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-06-05 00:14:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4674. [2021-06-05 00:14:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4673 states have (on average 3.2482345388401455) internal successors, (15179), 4673 states have internal predecessors, (15179), 0 states have call successors, (0), 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:14:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 15179 transitions. [2021-06-05 00:14:08,874 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 15179 transitions. Word has length 73 [2021-06-05 00:14:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:08,875 INFO L482 AbstractCegarLoop]: Abstraction has 4674 states and 15179 transitions. [2021-06-05 00:14:08,875 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:14:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 15179 transitions. [2021-06-05 00:14:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 00:14:08,884 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:08,884 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:14:08,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 00:14:08,884 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1691664101, now seen corresponding path program 1 times [2021-06-05 00:14:08,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:08,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704559757] [2021-06-05 00:14:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:09,099 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:14:09,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:09,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704559757] [2021-06-05 00:14:09,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704559757] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:09,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:09,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 00:14:09,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370204991] [2021-06-05 00:14:09,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 00:14:09,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 00:14:09,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 00:14:09,102 INFO L87 Difference]: Start difference. First operand 4674 states and 15179 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:14:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:09,522 INFO L93 Difference]: Finished difference Result 6086 states and 19685 transitions. [2021-06-05 00:14:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 00:14:09,522 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:14:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:09,531 INFO L225 Difference]: With dead ends: 6086 [2021-06-05 00:14:09,531 INFO L226 Difference]: Without dead ends: 4782 [2021-06-05 00:14:09,531 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 296.5ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:14:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2021-06-05 00:14:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4662. [2021-06-05 00:14:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4662 states, 4661 states have (on average 3.207680755202746) internal successors, (14951), 4661 states have internal predecessors, (14951), 0 states have call successors, (0), 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:14:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 14951 transitions. [2021-06-05 00:14:09,661 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 14951 transitions. Word has length 73 [2021-06-05 00:14:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:09,662 INFO L482 AbstractCegarLoop]: Abstraction has 4662 states and 14951 transitions. [2021-06-05 00:14:09,662 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:14:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 14951 transitions. [2021-06-05 00:14:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 00:14:09,670 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:09,670 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:14:09,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 00:14:09,670 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 133115822, now seen corresponding path program 1 times [2021-06-05 00:14:09,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:09,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170232852] [2021-06-05 00:14:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:09,770 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:14:09,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:09,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170232852] [2021-06-05 00:14:09,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170232852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:09,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:09,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:14:09,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337079355] [2021-06-05 00:14:09,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:14:09,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:14:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:14:09,774 INFO L87 Difference]: Start difference. First operand 4662 states and 14951 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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:14:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:09,902 INFO L93 Difference]: Finished difference Result 5560 states and 17524 transitions. [2021-06-05 00:14:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:14:09,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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:14:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:09,911 INFO L225 Difference]: With dead ends: 5560 [2021-06-05 00:14:09,912 INFO L226 Difference]: Without dead ends: 4152 [2021-06-05 00:14:09,912 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 91.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:14:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2021-06-05 00:14:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4152. [2021-06-05 00:14:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 3.1479161647795713) internal successors, (13067), 4151 states have internal predecessors, (13067), 0 states have call successors, (0), 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:14:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 13067 transitions. [2021-06-05 00:14:10,027 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 13067 transitions. Word has length 74 [2021-06-05 00:14:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:10,028 INFO L482 AbstractCegarLoop]: Abstraction has 4152 states and 13067 transitions. [2021-06-05 00:14:10,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 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:14:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 13067 transitions. [2021-06-05 00:14:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 00:14:10,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:10,040 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:14:10,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 00:14:10,041 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1379749443, now seen corresponding path program 1 times [2021-06-05 00:14:10,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:10,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804703225] [2021-06-05 00:14:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:10,150 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:14:10,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:10,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804703225] [2021-06-05 00:14:10,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804703225] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:10,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:10,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 00:14:10,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754128593] [2021-06-05 00:14:10,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 00:14:10,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:10,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 00:14:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 00:14:10,153 INFO L87 Difference]: Start difference. First operand 4152 states and 13067 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:14:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:10,289 INFO L93 Difference]: Finished difference Result 4008 states and 12263 transitions. [2021-06-05 00:14:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:14:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:14:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:10,294 INFO L225 Difference]: With dead ends: 4008 [2021-06-05 00:14:10,295 INFO L226 Difference]: Without dead ends: 2892 [2021-06-05 00:14:10,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 96.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:14:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2021-06-05 00:14:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2844. [2021-06-05 00:14:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 3.016883573689764) internal successors, (8577), 2843 states have internal predecessors, (8577), 0 states have call successors, (0), 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:14:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 8577 transitions. [2021-06-05 00:14:10,358 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 8577 transitions. Word has length 75 [2021-06-05 00:14:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:10,358 INFO L482 AbstractCegarLoop]: Abstraction has 2844 states and 8577 transitions. [2021-06-05 00:14:10,359 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:14:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 8577 transitions. [2021-06-05 00:14:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 00:14:10,364 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:10,364 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:14:10,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 00:14:10,365 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1348052516, now seen corresponding path program 1 times [2021-06-05 00:14:10,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:10,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729562772] [2021-06-05 00:14:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:10,477 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:14:10,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:10,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729562772] [2021-06-05 00:14:10,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729562772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:10,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:10,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 00:14:10,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393593668] [2021-06-05 00:14:10,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 00:14:10,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 00:14:10,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 00:14:10,479 INFO L87 Difference]: Start difference. First operand 2844 states and 8577 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:14:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:10,624 INFO L93 Difference]: Finished difference Result 2322 states and 6792 transitions. [2021-06-05 00:14:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:14:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:14:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:10,627 INFO L225 Difference]: With dead ends: 2322 [2021-06-05 00:14:10,627 INFO L226 Difference]: Without dead ends: 1449 [2021-06-05 00:14:10,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 119.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:14:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2021-06-05 00:14:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1401. [2021-06-05 00:14:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 2.8785714285714286) internal successors, (4030), 1400 states have internal predecessors, (4030), 0 states have call successors, (0), 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:14:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4030 transitions. [2021-06-05 00:14:10,664 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4030 transitions. Word has length 77 [2021-06-05 00:14:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:10,664 INFO L482 AbstractCegarLoop]: Abstraction has 1401 states and 4030 transitions. [2021-06-05 00:14:10,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:14:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4030 transitions. [2021-06-05 00:14:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 00:14:10,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:10,667 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] [2021-06-05 00:14:10,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 00:14:10,668 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash -146066099, now seen corresponding path program 1 times [2021-06-05 00:14:10,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:10,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922747564] [2021-06-05 00:14:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:10,982 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:14:10,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:10,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922747564] [2021-06-05 00:14:10,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922747564] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:10,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:10,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 00:14:10,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998580326] [2021-06-05 00:14:10,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 00:14:10,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 00:14:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:14:10,984 INFO L87 Difference]: Start difference. First operand 1401 states and 4030 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:14:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:11,280 INFO L93 Difference]: Finished difference Result 1971 states and 5745 transitions. [2021-06-05 00:14:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:14:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 00:14:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:11,283 INFO L225 Difference]: With dead ends: 1971 [2021-06-05 00:14:11,283 INFO L226 Difference]: Without dead ends: 1205 [2021-06-05 00:14:11,285 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 304.3ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:14:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2021-06-05 00:14:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1145. [2021-06-05 00:14:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 2.7674825174825175) internal successors, (3166), 1144 states have internal predecessors, (3166), 0 states have call successors, (0), 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:14:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3166 transitions. [2021-06-05 00:14:11,305 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 3166 transitions. Word has length 80 [2021-06-05 00:14:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:11,305 INFO L482 AbstractCegarLoop]: Abstraction has 1145 states and 3166 transitions. [2021-06-05 00:14:11,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:14:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 3166 transitions. [2021-06-05 00:14:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 00:14:11,308 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:11,308 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] [2021-06-05 00:14:11,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 00:14:11,308 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -490013491, now seen corresponding path program 2 times [2021-06-05 00:14:11,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:11,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019882823] [2021-06-05 00:14:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:14:11,873 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 00:14:11,955 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:14:11,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:14:11,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019882823] [2021-06-05 00:14:11,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019882823] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:14:11,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:14:11,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 00:14:11,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678495043] [2021-06-05 00:14:11,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 00:14:11,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:14:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 00:14:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-05 00:14:11,958 INFO L87 Difference]: Start difference. First operand 1145 states and 3166 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:14:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:14:12,412 INFO L93 Difference]: Finished difference Result 2279 states and 6565 transitions. [2021-06-05 00:14:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 00:14:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 00:14:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:14:12,415 INFO L225 Difference]: With dead ends: 2279 [2021-06-05 00:14:12,415 INFO L226 Difference]: Without dead ends: 1513 [2021-06-05 00:14:12,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 695.5ms TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-06-05 00:14:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-06-05 00:14:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 949. [2021-06-05 00:14:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.782700421940928) internal successors, (2638), 948 states have internal predecessors, (2638), 0 states have call successors, (0), 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:14:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2638 transitions. [2021-06-05 00:14:12,439 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2638 transitions. Word has length 80 [2021-06-05 00:14:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:14:12,439 INFO L482 AbstractCegarLoop]: Abstraction has 949 states and 2638 transitions. [2021-06-05 00:14:12,439 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 00:14:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2638 transitions. [2021-06-05 00:14:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 00:14:12,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:14:12,441 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] [2021-06-05 00:14:12,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 00:14:12,442 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:14:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:14:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2074299567, now seen corresponding path program 3 times [2021-06-05 00:14:12,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:14:12,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722579702] [2021-06-05 00:14:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:14:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:14:12,488 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:14:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:14:12,537 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:14:12,584 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 00:14:12,585 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 00:14:12,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 00:14:12,588 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 00:14:12,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:14:12 BasicIcfg [2021-06-05 00:14:12,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 00:14:12,726 INFO L168 Benchmark]: Toolchain (without parser) took 15503.16 ms. Allocated memory was 331.4 MB in the beginning and 3.1 GB in the end (delta: 2.7 GB). Free memory was 293.8 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB. [2021-06-05 00:14:12,726 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 331.4 MB. Free memory is still 311.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 00:14:12,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.15 ms. Allocated memory is still 331.4 MB. Free memory was 293.7 MB in the beginning and 289.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:14:12,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.10 ms. Allocated memory is still 331.4 MB. Free memory was 289.9 MB in the beginning and 286.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:14:12,727 INFO L168 Benchmark]: Boogie Preprocessor took 60.12 ms. Allocated memory is still 331.4 MB. Free memory was 286.7 MB in the beginning and 284.6 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:14:12,727 INFO L168 Benchmark]: RCFGBuilder took 2157.62 ms. Allocated memory is still 331.4 MB. Free memory was 284.6 MB in the beginning and 191.5 MB in the end (delta: 93.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:14:12,727 INFO L168 Benchmark]: TraceAbstraction took 12749.40 ms. Allocated memory was 331.4 MB in the beginning and 3.1 GB in the end (delta: 2.7 GB). Free memory was 191.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-06-05 00:14:12,727 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.16 ms. Allocated memory is still 331.4 MB. Free memory is still 311.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 466.15 ms. Allocated memory is still 331.4 MB. Free memory was 293.7 MB in the beginning and 289.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.10 ms. Allocated memory is still 331.4 MB. Free memory was 289.9 MB in the beginning and 286.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 60.12 ms. Allocated memory is still 331.4 MB. Free memory was 286.7 MB in the beginning and 284.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2157.62 ms. Allocated memory is still 331.4 MB. Free memory was 284.6 MB in the beginning and 191.5 MB in the end (delta: 93.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12749.40 ms. Allocated memory was 331.4 MB in the beginning and 3.1 GB in the end (delta: 2.7 GB). Free memory was 191.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 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] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2192; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2192, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2193; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2193, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2194; VAL [__unbuffered_cnt=1, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12500.7ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 185.6ms, AutomataDifference: 5263.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 751.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2174 SDtfs, 3624 SDslu, 9254 SDs, 0 SdLazy, 1368 SolverSat, 328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1479.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3718.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14150occurred in iteration=0, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2381.2ms AutomataMinimizationTime, 16 MinimizatonAttempts, 2320 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 64.3ms SsaConstructionTime, 629.0ms SatisfiabilityAnalysisTime, 2862.8ms InterpolantComputationTime, 1213 NumberOfCodeBlocks, 1213 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1117 ConstructedInterpolants, 0 QuantifiedInterpolants, 7051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...