/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:34:39,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:34:39,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:34:39,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:34:39,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:34:39,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:34:39,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:34:39,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:34:39,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:34:39,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:34:39,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:34:39,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:34:39,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:34:39,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:34:39,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:34:39,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:34:39,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:34:39,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:34:39,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:34:39,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:34:39,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:34:39,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:34:39,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:34:39,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:34:39,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:34:39,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:34:39,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:34:39,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:34:39,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:34:39,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:34:39,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:34:39,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:34:39,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:34:39,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:34:39,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:34:39,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:34:39,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:34:39,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:34:39,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:34:39,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:34:39,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:34:39,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-12 17:34:39,346 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:34:39,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:34:39,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:34:39,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:34:39,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:34:39,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:34:39,350 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:34:39,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:34:39,351 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:34:39,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:34:39,352 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:34:39,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:34:39,353 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:34:39,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:34:39,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:34:39,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:34:39,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:34:39,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:34:39,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:34:39,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:34:39,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:34:39,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:34:39,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:34:39,355 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:34:39,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:34:39,355 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-08-12 17:34:39,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:34:39,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:34:39,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:34:39,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:34:39,728 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:34:39,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-08-12 17:34:39,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f385f0a/fa5da236395f43e6af559d2f8ba3eada/FLAG9ea7b3275 [2021-08-12 17:34:40,270 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:34:40,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-08-12 17:34:40,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f385f0a/fa5da236395f43e6af559d2f8ba3eada/FLAG9ea7b3275 [2021-08-12 17:34:40,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f385f0a/fa5da236395f43e6af559d2f8ba3eada [2021-08-12 17:34:40,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:34:40,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:34:40,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:34:40,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:34:40,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:34:40,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:34:40" (1/1) ... [2021-08-12 17:34:40,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28639a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:40, skipping insertion in model container [2021-08-12 17:34:40,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:34:40" (1/1) ... [2021-08-12 17:34:40,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:34:40,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:34:40,816 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-08-12 17:34:41,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:34:41,060 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:34:41,072 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-08-12 17:34:41,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:34:41,191 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:34:41,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41 WrapperNode [2021-08-12 17:34:41,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:34:41,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:34:41,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:34:41,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:34:41,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:34:41,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:34:41,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:34:41,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:34:41,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (1/1) ... [2021-08-12 17:34:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:34:41,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:34:41,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:34:41,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:34:41,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (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-08-12 17:34:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:34:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:34:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:34:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:34:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:34:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:34:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:34:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:34:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:34:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:34:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:34:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:34:41,398 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:34:43,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:34:43,062 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:34:43,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:34:43 BoogieIcfgContainer [2021-08-12 17:34:43,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:34:43,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:34:43,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:34:43,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:34:43,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:34:40" (1/3) ... [2021-08-12 17:34:43,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9f2614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:34:43, skipping insertion in model container [2021-08-12 17:34:43,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:34:41" (2/3) ... [2021-08-12 17:34:43,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9f2614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:34:43, skipping insertion in model container [2021-08-12 17:34:43,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:34:43" (3/3) ... [2021-08-12 17:34:43,071 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-08-12 17:34:43,076 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:34:43,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:34:43,077 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:34:43,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,122 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,122 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:34:43,129 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:34:43,148 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-12 17:34:43,172 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:34:43,172 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:34:43,172 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:34:43,172 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:34:43,172 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:34:43,172 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:34:43,173 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:34:43,173 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:34:43,189 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-08-12 17:34:43,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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-08-12 17:34:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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-08-12 17:34:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-12 17:34:43,285 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:43,286 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:43,286 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-08-12 17:34:43,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:43,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32093112] [2021-08-12 17:34:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:43,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:43,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32093112] [2021-08-12 17:34:43,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32093112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:43,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:43,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:34:43,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607453142] [2021-08-12 17:34:43,579 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:34:43,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:43,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:34:43,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:34:43,594 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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-08-12 17:34:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:43,751 INFO L93 Difference]: Finished difference Result 2922 states and 8145 transitions. [2021-08-12 17:34:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:34:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2021-08-12 17:34:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:43,780 INFO L225 Difference]: With dead ends: 2922 [2021-08-12 17:34:43,780 INFO L226 Difference]: Without dead ends: 1051 [2021-08-12 17:34:43,789 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:34:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2021-08-12 17:34:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2021-08-12 17:34:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 2.5866666666666664) internal successors, (2716), 1050 states have internal predecessors, (2716), 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-08-12 17:34:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 2716 transitions. [2021-08-12 17:34:43,900 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 2716 transitions. Word has length 37 [2021-08-12 17:34:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:43,901 INFO L482 AbstractCegarLoop]: Abstraction has 1051 states and 2716 transitions. [2021-08-12 17:34:43,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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-08-12 17:34:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 2716 transitions. [2021-08-12 17:34:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-12 17:34:43,909 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:43,909 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:43,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:34:43,909 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-08-12 17:34:43,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:43,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872545779] [2021-08-12 17:34:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:44,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:44,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872545779] [2021-08-12 17:34:44,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872545779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:44,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:44,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:34:44,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333725421] [2021-08-12 17:34:44,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:34:44,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:34:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:34:44,172 INFO L87 Difference]: Start difference. First operand 1051 states and 2716 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:44,376 INFO L93 Difference]: Finished difference Result 1399 states and 3606 transitions. [2021-08-12 17:34:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:34:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-12 17:34:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:44,383 INFO L225 Difference]: With dead ends: 1399 [2021-08-12 17:34:44,383 INFO L226 Difference]: Without dead ends: 1015 [2021-08-12 17:34:44,385 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:34:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-08-12 17:34:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2021-08-12 17:34:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 2.5719921104536487) internal successors, (2608), 1014 states have internal predecessors, (2608), 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-08-12 17:34:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2608 transitions. [2021-08-12 17:34:44,419 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 2608 transitions. Word has length 56 [2021-08-12 17:34:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:44,419 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 2608 transitions. [2021-08-12 17:34:44,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2608 transitions. [2021-08-12 17:34:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-12 17:34:44,424 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:44,424 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:44,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:34:44,424 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1550290026, now seen corresponding path program 1 times [2021-08-12 17:34:44,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:44,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527003189] [2021-08-12 17:34:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:44,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:44,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527003189] [2021-08-12 17:34:44,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527003189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:44,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:44,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-12 17:34:44,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616827994] [2021-08-12 17:34:44,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-12 17:34:44,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:44,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-12 17:34:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:34:44,686 INFO L87 Difference]: Start difference. First operand 1015 states and 2608 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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-08-12 17:34:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:45,524 INFO L93 Difference]: Finished difference Result 1267 states and 3238 transitions. [2021-08-12 17:34:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-12 17:34:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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 58 [2021-08-12 17:34:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:45,531 INFO L225 Difference]: With dead ends: 1267 [2021-08-12 17:34:45,531 INFO L226 Difference]: Without dead ends: 919 [2021-08-12 17:34:45,532 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 608.3ms TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-08-12 17:34:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-08-12 17:34:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2021-08-12 17:34:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 2.5403050108932463) internal successors, (2332), 918 states have internal predecessors, (2332), 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-08-12 17:34:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2332 transitions. [2021-08-12 17:34:45,557 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 2332 transitions. Word has length 58 [2021-08-12 17:34:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:45,558 INFO L482 AbstractCegarLoop]: Abstraction has 919 states and 2332 transitions. [2021-08-12 17:34:45,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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-08-12 17:34:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 2332 transitions. [2021-08-12 17:34:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-12 17:34:45,560 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:45,560 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:45,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:34:45,560 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1303999016, now seen corresponding path program 1 times [2021-08-12 17:34:45,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:45,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760121976] [2021-08-12 17:34:45,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:45,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:45,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760121976] [2021-08-12 17:34:45,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760121976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:45,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:45,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:34:45,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563788800] [2021-08-12 17:34:45,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:34:45,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:34:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:34:45,691 INFO L87 Difference]: Start difference. First operand 919 states and 2332 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:45,826 INFO L93 Difference]: Finished difference Result 1609 states and 4082 transitions. [2021-08-12 17:34:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:34:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-12 17:34:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:45,833 INFO L225 Difference]: With dead ends: 1609 [2021-08-12 17:34:45,833 INFO L226 Difference]: Without dead ends: 1021 [2021-08-12 17:34:45,834 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 111.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:34:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-08-12 17:34:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 871. [2021-08-12 17:34:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.466666666666667) internal successors, (2146), 870 states have internal predecessors, (2146), 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-08-12 17:34:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions. [2021-08-12 17:34:45,860 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60 [2021-08-12 17:34:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:45,860 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions. [2021-08-12 17:34:45,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions. [2021-08-12 17:34:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-12 17:34:45,862 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:45,862 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:45,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:34:45,862 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash -638334108, now seen corresponding path program 1 times [2021-08-12 17:34:45,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:45,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191803242] [2021-08-12 17:34:45,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:46,102 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:46,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191803242] [2021-08-12 17:34:46,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191803242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:46,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:46,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-12 17:34:46,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400786618] [2021-08-12 17:34:46,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-12 17:34:46,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:46,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-12 17:34:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:34:46,104 INFO L87 Difference]: Start difference. First operand 871 states and 2146 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:46,784 INFO L93 Difference]: Finished difference Result 1130 states and 2763 transitions. [2021-08-12 17:34:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-12 17:34:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-12 17:34:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:46,789 INFO L225 Difference]: With dead ends: 1130 [2021-08-12 17:34:46,790 INFO L226 Difference]: Without dead ends: 810 [2021-08-12 17:34:46,791 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 495.9ms TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2021-08-12 17:34:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-08-12 17:34:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2021-08-12 17:34:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 2.422552664188352) internal successors, (1955), 807 states have internal predecessors, (1955), 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-08-12 17:34:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1955 transitions. [2021-08-12 17:34:46,812 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1955 transitions. Word has length 61 [2021-08-12 17:34:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:46,813 INFO L482 AbstractCegarLoop]: Abstraction has 808 states and 1955 transitions. [2021-08-12 17:34:46,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1955 transitions. [2021-08-12 17:34:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-12 17:34:46,815 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:46,815 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:46,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:34:46,815 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1801678580, now seen corresponding path program 2 times [2021-08-12 17:34:46,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:46,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990068264] [2021-08-12 17:34:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:46,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:46,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990068264] [2021-08-12 17:34:46,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990068264] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:46,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:46,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:34:46,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598200762] [2021-08-12 17:34:46,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:34:46,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:46,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:34:46,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:34:46,999 INFO L87 Difference]: Start difference. First operand 808 states and 1955 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:47,458 INFO L93 Difference]: Finished difference Result 1053 states and 2568 transitions. [2021-08-12 17:34:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 17:34:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-12 17:34:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:47,465 INFO L225 Difference]: With dead ends: 1053 [2021-08-12 17:34:47,466 INFO L226 Difference]: Without dead ends: 873 [2021-08-12 17:34:47,466 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 269.2ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-08-12 17:34:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2021-08-12 17:34:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 813. [2021-08-12 17:34:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 2.41871921182266) internal successors, (1964), 812 states have internal predecessors, (1964), 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-08-12 17:34:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1964 transitions. [2021-08-12 17:34:47,493 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1964 transitions. Word has length 61 [2021-08-12 17:34:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:47,494 INFO L482 AbstractCegarLoop]: Abstraction has 813 states and 1964 transitions. [2021-08-12 17:34:47,494 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1964 transitions. [2021-08-12 17:34:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-12 17:34:47,496 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:47,496 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:47,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:34:47,496 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2087995442, now seen corresponding path program 3 times [2021-08-12 17:34:47,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:47,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994000967] [2021-08-12 17:34:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:47,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:47,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994000967] [2021-08-12 17:34:47,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994000967] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:47,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:47,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:34:47,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119792275] [2021-08-12 17:34:47,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:34:47,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:47,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:34:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:34:47,734 INFO L87 Difference]: Start difference. First operand 813 states and 1964 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:48,064 INFO L93 Difference]: Finished difference Result 1058 states and 2580 transitions. [2021-08-12 17:34:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:34:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-12 17:34:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:48,074 INFO L225 Difference]: With dead ends: 1058 [2021-08-12 17:34:48,074 INFO L226 Difference]: Without dead ends: 862 [2021-08-12 17:34:48,075 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 217.0ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:34:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-08-12 17:34:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 823. [2021-08-12 17:34:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.429440389294404) internal successors, (1997), 822 states have internal predecessors, (1997), 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-08-12 17:34:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1997 transitions. [2021-08-12 17:34:48,105 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1997 transitions. Word has length 61 [2021-08-12 17:34:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:48,105 INFO L482 AbstractCegarLoop]: Abstraction has 823 states and 1997 transitions. [2021-08-12 17:34:48,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1997 transitions. [2021-08-12 17:34:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-12 17:34:48,107 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:48,107 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:48,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:34:48,107 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029783, now seen corresponding path program 1 times [2021-08-12 17:34:48,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:48,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735696468] [2021-08-12 17:34:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:48,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:48,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735696468] [2021-08-12 17:34:48,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735696468] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:48,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:48,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-12 17:34:48,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899102463] [2021-08-12 17:34:48,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-12 17:34:48,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-12 17:34:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:34:48,494 INFO L87 Difference]: Start difference. First operand 823 states and 1997 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-08-12 17:34:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:48,870 INFO L93 Difference]: Finished difference Result 1012 states and 2425 transitions. [2021-08-12 17:34:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 17:34:48,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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 62 [2021-08-12 17:34:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:48,875 INFO L225 Difference]: With dead ends: 1012 [2021-08-12 17:34:48,875 INFO L226 Difference]: Without dead ends: 805 [2021-08-12 17:34:48,876 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 407.0ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-08-12 17:34:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-08-12 17:34:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2021-08-12 17:34:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.4191542288557213) internal successors, (1945), 804 states have internal predecessors, (1945), 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-08-12 17:34:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1945 transitions. [2021-08-12 17:34:48,902 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1945 transitions. Word has length 62 [2021-08-12 17:34:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:48,902 INFO L482 AbstractCegarLoop]: Abstraction has 805 states and 1945 transitions. [2021-08-12 17:34:48,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-08-12 17:34:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1945 transitions. [2021-08-12 17:34:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-12 17:34:48,904 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:48,904 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:48,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:34:48,904 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 695919513, now seen corresponding path program 2 times [2021-08-12 17:34:48,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:48,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024554955] [2021-08-12 17:34:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:49,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:49,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024554955] [2021-08-12 17:34:49,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024554955] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:49,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:49,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:34:49,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349769851] [2021-08-12 17:34:49,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:34:49,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:49,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:34:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:34:49,120 INFO L87 Difference]: Start difference. First operand 805 states and 1945 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-08-12 17:34:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:49,339 INFO L93 Difference]: Finished difference Result 1227 states and 2967 transitions. [2021-08-12 17:34:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:34:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 62 [2021-08-12 17:34:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:49,346 INFO L225 Difference]: With dead ends: 1227 [2021-08-12 17:34:49,346 INFO L226 Difference]: Without dead ends: 1055 [2021-08-12 17:34:49,347 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:34:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2021-08-12 17:34:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 807. [2021-08-12 17:34:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.4081885856079404) internal successors, (1941), 806 states have internal predecessors, (1941), 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-08-12 17:34:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1941 transitions. [2021-08-12 17:34:49,383 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1941 transitions. Word has length 62 [2021-08-12 17:34:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:49,383 INFO L482 AbstractCegarLoop]: Abstraction has 807 states and 1941 transitions. [2021-08-12 17:34:49,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-08-12 17:34:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1941 transitions. [2021-08-12 17:34:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-12 17:34:49,385 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:49,385 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:49,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:34:49,385 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash 981807643, now seen corresponding path program 3 times [2021-08-12 17:34:49,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:49,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763471500] [2021-08-12 17:34:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:49,602 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:49,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763471500] [2021-08-12 17:34:49,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763471500] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:49,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:49,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:34:49,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354072184] [2021-08-12 17:34:49,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:34:49,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:34:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:34:49,603 INFO L87 Difference]: Start difference. First operand 807 states and 1941 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-08-12 17:34:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:49,955 INFO L93 Difference]: Finished difference Result 1231 states and 2971 transitions. [2021-08-12 17:34:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:34:49,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 62 [2021-08-12 17:34:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:49,960 INFO L225 Difference]: With dead ends: 1231 [2021-08-12 17:34:49,960 INFO L226 Difference]: Without dead ends: 774 [2021-08-12 17:34:49,961 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 281.0ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:34:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2021-08-12 17:34:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 649. [2021-08-12 17:34:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.3580246913580245) internal successors, (1528), 648 states have internal predecessors, (1528), 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-08-12 17:34:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1528 transitions. [2021-08-12 17:34:49,986 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1528 transitions. Word has length 62 [2021-08-12 17:34:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:49,986 INFO L482 AbstractCegarLoop]: Abstraction has 649 states and 1528 transitions. [2021-08-12 17:34:49,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-08-12 17:34:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1528 transitions. [2021-08-12 17:34:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-12 17:34:49,990 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:49,990 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:49,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:34:49,990 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -80791419, now seen corresponding path program 1 times [2021-08-12 17:34:49,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:49,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835331221] [2021-08-12 17:34:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:50,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:50,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835331221] [2021-08-12 17:34:50,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835331221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:50,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:50,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:34:50,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084009221] [2021-08-12 17:34:50,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:34:50,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:34:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:34:50,072 INFO L87 Difference]: Start difference. First operand 649 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-08-12 17:34:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:50,206 INFO L93 Difference]: Finished difference Result 955 states and 2260 transitions. [2021-08-12 17:34:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:34:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 62 [2021-08-12 17:34:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:50,211 INFO L225 Difference]: With dead ends: 955 [2021-08-12 17:34:50,211 INFO L226 Difference]: Without dead ends: 535 [2021-08-12 17:34:50,212 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:34:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-08-12 17:34:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2021-08-12 17:34:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 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-08-12 17:34:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions. [2021-08-12 17:34:50,233 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62 [2021-08-12 17:34:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:50,233 INFO L482 AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions. [2021-08-12 17:34:50,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-08-12 17:34:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions. [2021-08-12 17:34:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-12 17:34:50,234 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:50,235 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:50,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:34:50,235 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -615861270, now seen corresponding path program 1 times [2021-08-12 17:34:50,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:50,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204733472] [2021-08-12 17:34:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:34:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:34:50,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:34:50,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204733472] [2021-08-12 17:34:50,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204733472] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:34:50,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:34:50,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:34:50,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151117428] [2021-08-12 17:34:50,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:34:50,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:34:50,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:34:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:34:50,338 INFO L87 Difference]: Start difference. First operand 535 states and 1210 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:34:50,470 INFO L93 Difference]: Finished difference Result 643 states and 1453 transitions. [2021-08-12 17:34:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:34:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-12 17:34:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:34:50,473 INFO L225 Difference]: With dead ends: 643 [2021-08-12 17:34:50,473 INFO L226 Difference]: Without dead ends: 273 [2021-08-12 17:34:50,474 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:34:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-12 17:34:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-08-12 17:34:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 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-08-12 17:34:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions. [2021-08-12 17:34:50,487 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63 [2021-08-12 17:34:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:34:50,487 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 560 transitions. [2021-08-12 17:34:50,487 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:34:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions. [2021-08-12 17:34:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-12 17:34:50,488 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:34:50,488 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:34:50,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:34:50,488 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:34:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:34:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1463907637, now seen corresponding path program 1 times [2021-08-12 17:34:50,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:34:50,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131645774] [2021-08-12 17:34:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:34:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:34:50,526 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:34:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:34:50,567 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:34:50,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:34:50,610 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:34:50,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:34:50,613 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:34:50,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:34:50 BasicIcfg [2021-08-12 17:34:50,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:34:50,727 INFO L168 Benchmark]: Toolchain (without parser) took 10120.20 ms. Allocated memory was 186.6 MB in the beginning and 320.9 MB in the end (delta: 134.2 MB). Free memory was 150.1 MB in the beginning and 133.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 152.0 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,727 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 186.6 MB. Free memory is still 168.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:34:50,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.77 ms. Allocated memory is still 186.6 MB. Free memory was 149.7 MB in the beginning and 145.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.83 ms. Allocated memory is still 186.6 MB. Free memory was 145.6 MB in the beginning and 143.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,727 INFO L168 Benchmark]: Boogie Preprocessor took 54.95 ms. Allocated memory is still 186.6 MB. Free memory was 143.1 MB in the beginning and 140.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,727 INFO L168 Benchmark]: RCFGBuilder took 1739.44 ms. Allocated memory was 186.6 MB in the beginning and 234.9 MB in the end (delta: 48.2 MB). Free memory was 140.5 MB in the beginning and 194.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 85.9 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,728 INFO L168 Benchmark]: TraceAbstraction took 7660.34 ms. Allocated memory was 234.9 MB in the beginning and 320.9 MB in the end (delta: 86.0 MB). Free memory was 194.0 MB in the beginning and 133.2 MB in the end (delta: 60.8 MB). Peak memory consumption was 146.3 MB. Max. memory is 8.0 GB. [2021-08-12 17:34:50,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 186.6 MB. Free memory is still 168.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 583.77 ms. Allocated memory is still 186.6 MB. Free memory was 149.7 MB in the beginning and 145.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 74.83 ms. Allocated memory is still 186.6 MB. Free memory was 145.6 MB in the beginning and 143.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.95 ms. Allocated memory is still 186.6 MB. Free memory was 143.1 MB in the beginning and 140.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1739.44 ms. Allocated memory was 186.6 MB in the beginning and 234.9 MB in the end (delta: 48.2 MB). Free memory was 140.5 MB in the beginning and 194.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 85.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7660.34 ms. Allocated memory was 234.9 MB in the beginning and 320.9 MB in the end (delta: 86.0 MB). Free memory was 194.0 MB in the beginning and 133.2 MB in the end (delta: 60.8 MB). Peak memory consumption was 146.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7441.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 37.9ms, AutomataDifference: 4162.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 100.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1195 SDtfs, 2315 SDslu, 5398 SDs, 0 SdLazy, 1273 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1192.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 2850.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 356.6ms AutomataMinimizationTime, 12 MinimizatonAttempts, 624 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.2ms SsaConstructionTime, 462.4ms SatisfiabilityAnalysisTime, 1969.0ms InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 4475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...