/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:12:31,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:12:31,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:12:31,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:12:31,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:12:31,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:12:31,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:12:31,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:12:31,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:12:31,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:12:31,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:12:32,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:12:32,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:12:32,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:12:32,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:12:32,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:12:32,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:12:32,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:12:32,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:12:32,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:12:32,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:12:32,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:12:32,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:12:32,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:12:32,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:12:32,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:12:32,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:12:32,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:12:32,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:12:32,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:12:32,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:12:32,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:12:32,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:12:32,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:12:32,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:12:32,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:12:32,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:12:32,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:12:32,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:12:32,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:12:32,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:12:32,040 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-SemanticLbe.epf [2021-03-11 11:12:32,055 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:12:32,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:12:32,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:12:32,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:12:32,056 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:12:32,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:12:32,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:12:32,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:12:32,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:12:32,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:12:32,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:12:32,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:12:32,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:12:32,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 11:12:32,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:12:32,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:12:32,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:12:32,328 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:12:32,328 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:12:32,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-03-11 11:12:32,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b912962/2381e1b7a8c543cda68416ad1d64ea5f/FLAG75697b0b2 [2021-03-11 11:12:32,812 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:12:32,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-03-11 11:12:32,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b912962/2381e1b7a8c543cda68416ad1d64ea5f/FLAG75697b0b2 [2021-03-11 11:12:33,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b912962/2381e1b7a8c543cda68416ad1d64ea5f [2021-03-11 11:12:33,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:12:33,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:12:33,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:12:33,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:12:33,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:12:33,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5b00c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33, skipping insertion in model container [2021-03-11 11:12:33,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:12:33,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:12:33,368 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i[948,961] [2021-03-11 11:12:33,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:12:33,540 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:12:33,547 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i[948,961] [2021-03-11 11:12:33,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:12:33,654 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:12:33,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33 WrapperNode [2021-03-11 11:12:33,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:12:33,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:12:33,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:12:33,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:12:33,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:12:33,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:12:33,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:12:33,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:12:33,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... [2021-03-11 11:12:33,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:12:33,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:12:33,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:12:33,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:12:33,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:12:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:12:33,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:12:33,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:12:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:12:33,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:12:33,792 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:12:35,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:12:35,072 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:12:35,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:12:35 BoogieIcfgContainer [2021-03-11 11:12:35,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:12:35,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:12:35,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:12:35,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:12:35,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:12:33" (1/3) ... [2021-03-11 11:12:35,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc97e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:12:35, skipping insertion in model container [2021-03-11 11:12:35,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:12:33" (2/3) ... [2021-03-11 11:12:35,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc97e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:12:35, skipping insertion in model container [2021-03-11 11:12:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:12:35" (3/3) ... [2021-03-11 11:12:35,079 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2021-03-11 11:12:35,085 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:12:35,085 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:12:35,089 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:12:35,089 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:12:35,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:12:35,129 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:12:35,140 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 11:12:35,159 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:12:35,159 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:12:35,159 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:12:35,159 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:12:35,160 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:12:35,160 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:12:35,160 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:12:35,160 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:12:35,171 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:12:35,188 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2021-03-11 11:12:35,189 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2021-03-11 11:12:35,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-11 11:12:35,211 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-11 11:12:35,212 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:12:35,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-11 11:12:35,215 INFO L116 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-11 11:12:35,890 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-11 11:12:36,168 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-11 11:12:37,425 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-11 11:12:37,972 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-11 11:12:38,298 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:12:38,658 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-11 11:12:38,780 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 11:12:40,013 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-11 11:12:40,137 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-11 11:12:41,279 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-11 11:12:41,405 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-11 11:12:41,635 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-11 11:12:41,739 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-11 11:12:41,741 INFO L131 LiptonReduction]: Checked pairs total: 2203 [2021-03-11 11:12:41,741 INFO L133 LiptonReduction]: Total number of compositions: 70 [2021-03-11 11:12:41,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2021-03-11 11:12:41,757 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 192 states, 188 states have (on average 2.627659574468085) internal successors, (494), 191 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 188 states have (on average 2.627659574468085) internal successors, (494), 191 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 11:12:41,762 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:41,762 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 11:12:41,762 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 877700905, now seen corresponding path program 1 times [2021-03-11 11:12:41,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:41,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202212236] [2021-03-11 11:12:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:41,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:41,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:12:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:41,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202212236] [2021-03-11 11:12:41,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:41,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:12:41,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393942751] [2021-03-11 11:12:41,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:12:41,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:12:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:12:41,903 INFO L87 Difference]: Start difference. First operand has 192 states, 188 states have (on average 2.627659574468085) internal successors, (494), 191 states have internal predecessors, (494), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:41,937 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2021-03-11 11:12:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:12:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-03-11 11:12:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:41,944 INFO L225 Difference]: With dead ends: 162 [2021-03-11 11:12:41,945 INFO L226 Difference]: Without dead ends: 137 [2021-03-11 11:12:41,945 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:12:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-03-11 11:12:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-03-11 11:12:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.3529411764705883) internal successors, (320), 136 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2021-03-11 11:12:41,972 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2021-03-11 11:12:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:41,973 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2021-03-11 11:12:41,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2021-03-11 11:12:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-03-11 11:12:41,975 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:41,975 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:41,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:12:41,975 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash -171715443, now seen corresponding path program 1 times [2021-03-11 11:12:41,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:41,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022672244] [2021-03-11 11:12:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:42,107 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-03-11 11:12:42,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:12:42,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 11:12:42,125 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:12:42,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:12:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:42,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022672244] [2021-03-11 11:12:42,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:42,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:12:42,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958881054] [2021-03-11 11:12:42,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:12:42,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:42,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:12:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:12:42,132 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:42,203 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2021-03-11 11:12:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:12:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-03-11 11:12:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:42,206 INFO L225 Difference]: With dead ends: 152 [2021-03-11 11:12:42,206 INFO L226 Difference]: Without dead ends: 127 [2021-03-11 11:12:42,207 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.0ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:12:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-03-11 11:12:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-03-11 11:12:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3174603174603177) internal successors, (292), 126 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2021-03-11 11:12:42,215 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2021-03-11 11:12:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:42,215 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2021-03-11 11:12:42,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2021-03-11 11:12:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 11:12:42,216 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:42,216 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:42,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:12:42,216 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1049465108, now seen corresponding path program 1 times [2021-03-11 11:12:42,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:42,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214041791] [2021-03-11 11:12:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:42,298 INFO L142 QuantifierPusher]: treesize reduction 4, result has 80.0 percent of original size [2021-03-11 11:12:42,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:12:42,314 INFO L142 QuantifierPusher]: treesize reduction 14, result has 78.1 percent of original size [2021-03-11 11:12:42,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 11:12:42,332 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-11 11:12:42,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-11 11:12:42,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 11:12:42,357 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:12:42,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:12:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:42,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214041791] [2021-03-11 11:12:42,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:42,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:12:42,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958324867] [2021-03-11 11:12:42,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:12:42,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:12:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:12:42,364 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:42,484 INFO L93 Difference]: Finished difference Result 145 states and 321 transitions. [2021-03-11 11:12:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:12:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-03-11 11:12:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:42,489 INFO L225 Difference]: With dead ends: 145 [2021-03-11 11:12:42,489 INFO L226 Difference]: Without dead ends: 125 [2021-03-11 11:12:42,489 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 78.0ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:12:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-03-11 11:12:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-03-11 11:12:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.2903225806451615) internal successors, (284), 124 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 284 transitions. [2021-03-11 11:12:42,496 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 284 transitions. Word has length 9 [2021-03-11 11:12:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 284 transitions. [2021-03-11 11:12:42,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 284 transitions. [2021-03-11 11:12:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:12:42,497 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:42,497 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:42,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:12:42,497 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1564293417, now seen corresponding path program 1 times [2021-03-11 11:12:42,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:42,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926142950] [2021-03-11 11:12:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:42,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:12:42,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:12:42,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:12:42,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:12:42,614 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:12:42,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:12:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:42,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926142950] [2021-03-11 11:12:42,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:42,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:12:42,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875575317] [2021-03-11 11:12:42,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:12:42,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:12:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:12:42,620 INFO L87 Difference]: Start difference. First operand 125 states and 284 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:42,726 INFO L93 Difference]: Finished difference Result 133 states and 291 transitions. [2021-03-11 11:12:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 11:12:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-03-11 11:12:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:42,727 INFO L225 Difference]: With dead ends: 133 [2021-03-11 11:12:42,727 INFO L226 Difference]: Without dead ends: 121 [2021-03-11 11:12:42,727 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:12:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-03-11 11:12:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2021-03-11 11:12:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.245614035087719) internal successors, (256), 114 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 256 transitions. [2021-03-11 11:12:42,731 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 256 transitions. Word has length 11 [2021-03-11 11:12:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:42,731 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 256 transitions. [2021-03-11 11:12:42,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 256 transitions. [2021-03-11 11:12:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:12:42,732 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:42,732 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:42,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:12:42,732 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash 781002221, now seen corresponding path program 1 times [2021-03-11 11:12:42,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:42,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306083270] [2021-03-11 11:12:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:42,782 INFO L142 QuantifierPusher]: treesize reduction 18, result has 40.0 percent of original size [2021-03-11 11:12:42,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 11:12:42,815 INFO L142 QuantifierPusher]: treesize reduction 26, result has 33.3 percent of original size [2021-03-11 11:12:42,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:12:42,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:12:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:42,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306083270] [2021-03-11 11:12:42,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:42,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:12:42,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333536397] [2021-03-11 11:12:42,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:12:42,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:12:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:12:42,826 INFO L87 Difference]: Start difference. First operand 115 states and 256 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:42,844 INFO L93 Difference]: Finished difference Result 96 states and 180 transitions. [2021-03-11 11:12:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:12:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-03-11 11:12:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:42,846 INFO L225 Difference]: With dead ends: 96 [2021-03-11 11:12:42,846 INFO L226 Difference]: Without dead ends: 71 [2021-03-11 11:12:42,846 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:12:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-03-11 11:12:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-03-11 11:12:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 70 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 124 transitions. [2021-03-11 11:12:42,856 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 124 transitions. Word has length 11 [2021-03-11 11:12:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:42,856 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 124 transitions. [2021-03-11 11:12:42,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 124 transitions. [2021-03-11 11:12:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:12:42,857 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:42,858 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:42,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:12:42,858 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1167739236, now seen corresponding path program 1 times [2021-03-11 11:12:42,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:42,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768106911] [2021-03-11 11:12:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:42,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:12:42,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:12:42,922 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:12:42,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:12:42,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:42,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:12:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:42,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768106911] [2021-03-11 11:12:42,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:42,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:12:42,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837492303] [2021-03-11 11:12:42,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:12:42,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:12:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:12:42,930 INFO L87 Difference]: Start difference. First operand 71 states and 124 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:42,951 INFO L93 Difference]: Finished difference Result 50 states and 80 transitions. [2021-03-11 11:12:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:12:42,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-03-11 11:12:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:42,953 INFO L225 Difference]: With dead ends: 50 [2021-03-11 11:12:42,953 INFO L226 Difference]: Without dead ends: 41 [2021-03-11 11:12:42,953 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:12:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-03-11 11:12:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-03-11 11:12:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2021-03-11 11:12:42,955 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2021-03-11 11:12:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:42,955 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2021-03-11 11:12:42,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2021-03-11 11:12:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:12:42,956 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:42,956 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:42,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:12:42,956 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 965498659, now seen corresponding path program 1 times [2021-03-11 11:12:42,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:42,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44699358] [2021-03-11 11:12:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:12:43,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:43,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:12:43,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:43,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:12:43,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:12:43,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:12:43,024 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:12:43,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:12:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:12:43,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44699358] [2021-03-11 11:12:43,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:12:43,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:12:43,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986681717] [2021-03-11 11:12:43,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:12:43,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:12:43,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:12:43,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:12:43,031 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:12:43,053 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2021-03-11 11:12:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:12:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-03-11 11:12:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:12:43,054 INFO L225 Difference]: With dead ends: 56 [2021-03-11 11:12:43,054 INFO L226 Difference]: Without dead ends: 25 [2021-03-11 11:12:43,055 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:12:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-03-11 11:12:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-03-11 11:12:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-03-11 11:12:43,063 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2021-03-11 11:12:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:12:43,063 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-03-11 11:12:43,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:12:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-03-11 11:12:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:12:43,063 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:12:43,063 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:12:43,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:12:43,064 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:12:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:12:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash -273894079, now seen corresponding path program 2 times [2021-03-11 11:12:43,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:12:43,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782955365] [2021-03-11 11:12:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:12:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:12:43,091 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:12:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:12:43,137 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:12:43,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:12:43,166 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:12:43,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:12:43,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:12:43 BasicIcfg [2021-03-11 11:12:43,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:12:43,222 INFO L168 Benchmark]: Toolchain (without parser) took 10047.89 ms. Allocated memory was 367.0 MB in the beginning and 528.5 MB in the end (delta: 161.5 MB). Free memory was 329.8 MB in the beginning and 418.7 MB in the end (delta: -88.8 MB). Peak memory consumption was 74.5 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,222 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 367.0 MB. Free memory was 348.1 MB in the beginning and 348.0 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:12:43,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.80 ms. Allocated memory is still 367.0 MB. Free memory was 329.2 MB in the beginning and 325.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.06 ms. Allocated memory is still 367.0 MB. Free memory was 325.6 MB in the beginning and 323.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,223 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 367.0 MB. Free memory was 323.5 MB in the beginning and 321.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,223 INFO L168 Benchmark]: RCFGBuilder took 1336.41 ms. Allocated memory is still 367.0 MB. Free memory was 321.4 MB in the beginning and 313.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 170.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,224 INFO L168 Benchmark]: TraceAbstraction took 8146.02 ms. Allocated memory was 367.0 MB in the beginning and 528.5 MB in the end (delta: 161.5 MB). Free memory was 313.8 MB in the beginning and 418.7 MB in the end (delta: -104.9 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. [2021-03-11 11:12:43,225 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 367.0 MB. Free memory was 348.1 MB in the beginning and 348.0 MB in the end (delta: 76.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 475.80 ms. Allocated memory is still 367.0 MB. Free memory was 329.2 MB in the beginning and 325.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.06 ms. Allocated memory is still 367.0 MB. Free memory was 325.6 MB in the beginning and 323.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 367.0 MB. Free memory was 323.5 MB in the beginning and 321.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1336.41 ms. Allocated memory is still 367.0 MB. Free memory was 321.4 MB in the beginning and 313.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 170.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8146.02 ms. Allocated memory was 367.0 MB in the beginning and 528.5 MB in the end (delta: 161.5 MB). Free memory was 313.8 MB in the beginning and 418.7 MB in the end (delta: -104.9 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6551.8ms, 85 PlacesBefore, 27 PlacesAfterwards, 80 TransitionsBefore, 21 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2203 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1012, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 594, positive: 566, positive conditional: 0, positive unconditional: 566, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 594, positive: 551, positive conditional: 0, positive unconditional: 551, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 393, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 366, negative conditional: 0, negative unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1012, positive: 340, positive conditional: 0, positive unconditional: 340, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 594, unknown conditional: 0, unknown unconditional: 594] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8008.8ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 10.2ms, AutomataDifference: 428.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6597.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 126 SDtfs, 129 SDslu, 252 SDs, 0 SdLazy, 203 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 208.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 247.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 56.8ms AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.6ms SsaConstructionTime, 211.2ms SatisfiabilityAnalysisTime, 493.8ms InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...