/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 22:10:19,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 22:10:19,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 22:10:19,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 22:10:19,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 22:10:19,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 22:10:19,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 22:10:19,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 22:10:19,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 22:10:19,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 22:10:19,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 22:10:19,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 22:10:19,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 22:10:19,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 22:10:19,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 22:10:19,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 22:10:19,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 22:10:19,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 22:10:19,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 22:10:19,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 22:10:19,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 22:10:19,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 22:10:19,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 22:10:19,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 22:10:19,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 22:10:19,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 22:10:19,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 22:10:19,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 22:10:19,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 22:10:19,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 22:10:19,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 22:10:19,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 22:10:19,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 22:10:19,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 22:10:19,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 22:10:19,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 22:10:19,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 22:10:19,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 22:10:19,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 22:10:19,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 22:10:19,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 22:10:19,392 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-Delay.epf [2021-07-09 22:10:19,420 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 22:10:19,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 22:10:19,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 22:10:19,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 22:10:19,423 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 22:10:19,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 22:10:19,423 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 22:10:19,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 22:10:19,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 22:10:19,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 22:10:19,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 22:10:19,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 22:10:19,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 22:10:19,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 22:10:19,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:10:19,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 22:10:19,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 22:10:19,427 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-09 22:10:19,427 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-07-09 22:10:19,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 22:10:19,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 22:10:19,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 22:10:19,701 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 22:10:19,701 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 22:10:19,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-07-09 22:10:19,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84214142/8373808962b245cd8d4d15bbe4217e8e/FLAGe0df50342 [2021-07-09 22:10:20,173 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 22:10:20,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-07-09 22:10:20,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84214142/8373808962b245cd8d4d15bbe4217e8e/FLAGe0df50342 [2021-07-09 22:10:20,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84214142/8373808962b245cd8d4d15bbe4217e8e [2021-07-09 22:10:20,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 22:10:20,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 22:10:20,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 22:10:20,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 22:10:20,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 22:10:20,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de52028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20, skipping insertion in model container [2021-07-09 22:10:20,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 22:10:20,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 22:10:20,386 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i[949,962] [2021-07-09 22:10:20,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:10:20,652 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 22:10:20,672 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i[949,962] [2021-07-09 22:10:20,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:10:20,825 INFO L208 MainTranslator]: Completed translation [2021-07-09 22:10:20,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20 WrapperNode [2021-07-09 22:10:20,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 22:10:20,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 22:10:20,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 22:10:20,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 22:10:20,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 22:10:20,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 22:10:20,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 22:10:20,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 22:10:20,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (1/1) ... [2021-07-09 22:10:20,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 22:10:20,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 22:10:20,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 22:10:20,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 22:10:20,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (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-07-09 22:10:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 22:10:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 22:10:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 22:10:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 22:10:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 22:10:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 22:10:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 22:10:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 22:10:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 22:10:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 22:10:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 22:10:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 22:10:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 22:10:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 22:10:21,019 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 22:10:22,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 22:10:22,407 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 22:10:22,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:10:22 BoogieIcfgContainer [2021-07-09 22:10:22,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 22:10:22,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 22:10:22,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 22:10:22,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 22:10:22,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 10:10:20" (1/3) ... [2021-07-09 22:10:22,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1bbf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:10:22, skipping insertion in model container [2021-07-09 22:10:22,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:10:20" (2/3) ... [2021-07-09 22:10:22,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1bbf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:10:22, skipping insertion in model container [2021-07-09 22:10:22,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:10:22" (3/3) ... [2021-07-09 22:10:22,415 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i [2021-07-09 22:10:22,422 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 22:10:22,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 22:10:22,422 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 22:10:22,423 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 22:10:22,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:10:22,466 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 22:10:22,480 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 22:10:22,490 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 22:10:22,491 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 22:10:22,491 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 22:10:22,491 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 22:10:22,491 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 22:10:22,491 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 22:10:22,491 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 22:10:22,491 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 22:10:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 9815 states, 8572 states have (on average 2.1728884741017267) internal successors, (18626), 9814 states have internal predecessors, (18626), 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-07-09 22:10:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 22:10:23,464 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:23,464 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:23,465 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -81503802, now seen corresponding path program 1 times [2021-07-09 22:10:23,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:23,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891267779] [2021-07-09 22:10:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:23,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:23,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:23,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:23,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:23,786 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:23,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:23,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:23,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:23,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:23,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:23,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:23,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:23,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:23,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891267779] [2021-07-09 22:10:23,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891267779] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:23,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:23,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:10:23,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958156449] [2021-07-09 22:10:23,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:10:23,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:10:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:10:23,842 INFO L87 Difference]: Start difference. First operand has 9815 states, 8572 states have (on average 2.1728884741017267) internal successors, (18626), 9814 states have internal predecessors, (18626), 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 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:24,007 INFO L93 Difference]: Finished difference Result 11795 states and 22905 transitions. [2021-07-09 22:10:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:10:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-09 22:10:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:24,051 INFO L225 Difference]: With dead ends: 11795 [2021-07-09 22:10:24,051 INFO L226 Difference]: Without dead ends: 5491 [2021-07-09 22:10:24,052 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:10:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2021-07-09 22:10:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 5491. [2021-07-09 22:10:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5491 states, 5419 states have (on average 2.351356338807898) internal successors, (12742), 5490 states have internal predecessors, (12742), 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-07-09 22:10:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 12742 transitions. [2021-07-09 22:10:24,278 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 12742 transitions. Word has length 67 [2021-07-09 22:10:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:24,280 INFO L482 AbstractCegarLoop]: Abstraction has 5491 states and 12742 transitions. [2021-07-09 22:10:24,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 12742 transitions. [2021-07-09 22:10:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-09 22:10:24,288 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:24,288 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:24,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 22:10:24,289 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1476071225, now seen corresponding path program 1 times [2021-07-09 22:10:24,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:24,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636984226] [2021-07-09 22:10:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:24,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:24,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:24,465 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:24,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:24,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:24,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:24,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:24,498 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:24,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636984226] [2021-07-09 22:10:24,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636984226] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:24,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:24,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:10:24,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410659882] [2021-07-09 22:10:24,499 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:10:24,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:10:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:10:24,501 INFO L87 Difference]: Start difference. First operand 5491 states and 12742 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:24,626 INFO L93 Difference]: Finished difference Result 6139 states and 15012 transitions. [2021-07-09 22:10:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:10:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-07-09 22:10:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:24,646 INFO L225 Difference]: With dead ends: 6139 [2021-07-09 22:10:24,647 INFO L226 Difference]: Without dead ends: 4843 [2021-07-09 22:10:24,648 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:10:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2021-07-09 22:10:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4843. [2021-07-09 22:10:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4771 states have (on average 2.4078809473904843) internal successors, (11488), 4842 states have internal predecessors, (11488), 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-07-09 22:10:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 11488 transitions. [2021-07-09 22:10:24,773 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 11488 transitions. Word has length 69 [2021-07-09 22:10:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:24,775 INFO L482 AbstractCegarLoop]: Abstraction has 4843 states and 11488 transitions. [2021-07-09 22:10:24,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 11488 transitions. [2021-07-09 22:10:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 22:10:24,785 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:24,785 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:24,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 22:10:24,786 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1080785100, now seen corresponding path program 1 times [2021-07-09 22:10:24,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:24,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556897382] [2021-07-09 22:10:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:24,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:24,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:24,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:24,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:10:24,936 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-07-09 22:10:24,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-09 22:10:24,957 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:24,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:24,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:24,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:24,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:24,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:24,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:24,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556897382] [2021-07-09 22:10:24,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556897382] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:24,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:24,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 22:10:24,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563642664] [2021-07-09 22:10:24,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 22:10:24,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:24,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 22:10:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-09 22:10:24,991 INFO L87 Difference]: Start difference. First operand 4843 states and 11488 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:25,269 INFO L93 Difference]: Finished difference Result 5775 states and 14390 transitions. [2021-07-09 22:10:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 22:10:25,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-09 22:10:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:25,289 INFO L225 Difference]: With dead ends: 5775 [2021-07-09 22:10:25,289 INFO L226 Difference]: Without dead ends: 4711 [2021-07-09 22:10:25,290 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 157.6ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-07-09 22:10:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2021-07-09 22:10:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4687. [2021-07-09 22:10:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4615 states have (on average 2.40931744312026) internal successors, (11119), 4686 states have internal predecessors, (11119), 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-07-09 22:10:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 11119 transitions. [2021-07-09 22:10:25,383 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 11119 transitions. Word has length 70 [2021-07-09 22:10:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:25,384 INFO L482 AbstractCegarLoop]: Abstraction has 4687 states and 11119 transitions. [2021-07-09 22:10:25,384 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 11119 transitions. [2021-07-09 22:10:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 22:10:25,391 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:25,391 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:25,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 22:10:25,391 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash 145348488, now seen corresponding path program 1 times [2021-07-09 22:10:25,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:25,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325622426] [2021-07-09 22:10:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:25,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:25,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:25,502 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:25,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:25,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:25,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:25,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:25,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:25,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325622426] [2021-07-09 22:10:25,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325622426] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:25,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:25,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:10:25,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717575425] [2021-07-09 22:10:25,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:10:25,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:10:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:10:25,528 INFO L87 Difference]: Start difference. First operand 4687 states and 11119 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:25,637 INFO L93 Difference]: Finished difference Result 7908 states and 20306 transitions. [2021-07-09 22:10:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:10:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-09 22:10:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:25,655 INFO L225 Difference]: With dead ends: 7908 [2021-07-09 22:10:25,655 INFO L226 Difference]: Without dead ends: 4474 [2021-07-09 22:10:25,655 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:10:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2021-07-09 22:10:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 3454. [2021-07-09 22:10:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3400 states have (on average 2.5176470588235293) internal successors, (8560), 3453 states have internal predecessors, (8560), 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-07-09 22:10:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 8560 transitions. [2021-07-09 22:10:25,728 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 8560 transitions. Word has length 71 [2021-07-09 22:10:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:25,728 INFO L482 AbstractCegarLoop]: Abstraction has 3454 states and 8560 transitions. [2021-07-09 22:10:25,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 8560 transitions. [2021-07-09 22:10:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 22:10:25,732 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:25,732 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:25,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 22:10:25,733 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2028471962, now seen corresponding path program 1 times [2021-07-09 22:10:25,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:25,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738193396] [2021-07-09 22:10:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:25,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:25,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:25,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:25,811 INFO L142 QuantifierPusher]: treesize reduction 26, result has 51.9 percent of original size [2021-07-09 22:10:25,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-09 22:10:25,826 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-07-09 22:10:25,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-09 22:10:25,843 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:25,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:25,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:25,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:25,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:25,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:25,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:25,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738193396] [2021-07-09 22:10:25,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738193396] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:25,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:25,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 22:10:25,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214297308] [2021-07-09 22:10:25,875 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 22:10:25,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 22:10:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-09 22:10:25,875 INFO L87 Difference]: Start difference. First operand 3454 states and 8560 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:26,230 INFO L93 Difference]: Finished difference Result 3882 states and 9876 transitions. [2021-07-09 22:10:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 22:10:26,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 22:10:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:26,238 INFO L225 Difference]: With dead ends: 3882 [2021-07-09 22:10:26,238 INFO L226 Difference]: Without dead ends: 3222 [2021-07-09 22:10:26,239 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 212.2ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-07-09 22:10:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2021-07-09 22:10:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3170. [2021-07-09 22:10:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3122 states have (on average 2.4830237027546445) internal successors, (7752), 3169 states have internal predecessors, (7752), 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-07-09 22:10:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 7752 transitions. [2021-07-09 22:10:26,299 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 7752 transitions. Word has length 72 [2021-07-09 22:10:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:26,300 INFO L482 AbstractCegarLoop]: Abstraction has 3170 states and 7752 transitions. [2021-07-09 22:10:26,300 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 7752 transitions. [2021-07-09 22:10:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 22:10:26,304 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:26,304 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:26,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 22:10:26,305 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1107616350, now seen corresponding path program 2 times [2021-07-09 22:10:26,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:26,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317672776] [2021-07-09 22:10:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:26,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:26,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:26,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:26,366 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:26,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:26,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:26,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:26,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:26,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:26,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317672776] [2021-07-09 22:10:26,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317672776] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:26,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:26,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:10:26,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66224107] [2021-07-09 22:10:26,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:10:26,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:10:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:10:26,398 INFO L87 Difference]: Start difference. First operand 3170 states and 7752 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:26,510 INFO L93 Difference]: Finished difference Result 4316 states and 10819 transitions. [2021-07-09 22:10:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:10:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 22:10:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:26,515 INFO L225 Difference]: With dead ends: 4316 [2021-07-09 22:10:26,515 INFO L226 Difference]: Without dead ends: 2175 [2021-07-09 22:10:26,516 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 92.0ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-09 22:10:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2021-07-09 22:10:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2173. [2021-07-09 22:10:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2143 states have (on average 2.473168455436304) internal successors, (5300), 2172 states have internal predecessors, (5300), 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-07-09 22:10:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 5300 transitions. [2021-07-09 22:10:26,568 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 5300 transitions. Word has length 72 [2021-07-09 22:10:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:26,568 INFO L482 AbstractCegarLoop]: Abstraction has 2173 states and 5300 transitions. [2021-07-09 22:10:26,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 5300 transitions. [2021-07-09 22:10:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 22:10:26,574 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:26,574 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:26,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 22:10:26,575 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -362643636, now seen corresponding path program 1 times [2021-07-09 22:10:26,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:26,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237674166] [2021-07-09 22:10:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:26,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:26,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:26,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:26,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:10:26,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-09 22:10:26,689 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-07-09 22:10:26,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:10:26,712 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-07-09 22:10:26,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:10:26,734 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:26,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:26,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:26,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:26,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:26,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:26,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:26,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237674166] [2021-07-09 22:10:26,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237674166] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:26,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:26,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 22:10:26,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459648449] [2021-07-09 22:10:26,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 22:10:26,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 22:10:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:10:26,772 INFO L87 Difference]: Start difference. First operand 2173 states and 5300 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:26,991 INFO L93 Difference]: Finished difference Result 2641 states and 6758 transitions. [2021-07-09 22:10:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 22:10:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 22:10:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:26,997 INFO L225 Difference]: With dead ends: 2641 [2021-07-09 22:10:26,997 INFO L226 Difference]: Without dead ends: 2161 [2021-07-09 22:10:27,000 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 181.9ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-07-09 22:10:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2021-07-09 22:10:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2021-07-09 22:10:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2131 states have (on average 2.4645706241201313) internal successors, (5252), 2160 states have internal predecessors, (5252), 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-07-09 22:10:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 5252 transitions. [2021-07-09 22:10:27,041 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 5252 transitions. Word has length 74 [2021-07-09 22:10:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:27,042 INFO L482 AbstractCegarLoop]: Abstraction has 2161 states and 5252 transitions. [2021-07-09 22:10:27,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 5252 transitions. [2021-07-09 22:10:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 22:10:27,045 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:27,045 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:27,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 22:10:27,046 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1007420046, now seen corresponding path program 1 times [2021-07-09 22:10:27,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:27,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114383044] [2021-07-09 22:10:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:27,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:27,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:27,112 INFO L142 QuantifierPusher]: treesize reduction 21, result has 73.1 percent of original size [2021-07-09 22:10:27,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-07-09 22:10:27,121 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-07-09 22:10:27,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:10:27,142 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-07-09 22:10:27,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:10:27,162 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:27,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:27,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:27,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:27,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:27,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:27,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114383044] [2021-07-09 22:10:27,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114383044] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:27,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:27,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 22:10:27,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092985005] [2021-07-09 22:10:27,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 22:10:27,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 22:10:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-09 22:10:27,200 INFO L87 Difference]: Start difference. First operand 2161 states and 5252 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:27,344 INFO L93 Difference]: Finished difference Result 2567 states and 6502 transitions. [2021-07-09 22:10:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:10:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-09 22:10:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:27,349 INFO L225 Difference]: With dead ends: 2567 [2021-07-09 22:10:27,349 INFO L226 Difference]: Without dead ends: 2167 [2021-07-09 22:10:27,350 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 106.9ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-07-09 22:10:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2021-07-09 22:10:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2021-07-09 22:10:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2137 states have (on average 2.461862423958821) internal successors, (5261), 2166 states have internal predecessors, (5261), 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-07-09 22:10:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5261 transitions. [2021-07-09 22:10:27,380 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5261 transitions. Word has length 75 [2021-07-09 22:10:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:27,381 INFO L482 AbstractCegarLoop]: Abstraction has 2167 states and 5261 transitions. [2021-07-09 22:10:27,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5261 transitions. [2021-07-09 22:10:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 22:10:27,384 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:27,384 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:27,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 22:10:27,384 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -565474542, now seen corresponding path program 2 times [2021-07-09 22:10:27,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:27,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812990115] [2021-07-09 22:10:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:27,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:27,439 INFO L142 QuantifierPusher]: treesize reduction 37, result has 38.3 percent of original size [2021-07-09 22:10:27,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:10:27,443 INFO L142 QuantifierPusher]: treesize reduction 37, result has 52.6 percent of original size [2021-07-09 22:10:27,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-09 22:10:27,460 INFO L142 QuantifierPusher]: treesize reduction 37, result has 54.3 percent of original size [2021-07-09 22:10:27,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-09 22:10:27,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:10:27,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:10:27,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:27,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:27,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:27,508 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:27,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812990115] [2021-07-09 22:10:27,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812990115] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:27,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:27,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 22:10:27,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607023340] [2021-07-09 22:10:27,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 22:10:27,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 22:10:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-09 22:10:27,511 INFO L87 Difference]: Start difference. First operand 2167 states and 5261 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:27,795 INFO L93 Difference]: Finished difference Result 2891 states and 7405 transitions. [2021-07-09 22:10:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:10:27,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-09 22:10:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:27,800 INFO L225 Difference]: With dead ends: 2891 [2021-07-09 22:10:27,800 INFO L226 Difference]: Without dead ends: 2413 [2021-07-09 22:10:27,801 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 226.0ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-07-09 22:10:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2021-07-09 22:10:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2279. [2021-07-09 22:10:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2249 states have (on average 2.445086705202312) internal successors, (5499), 2278 states have internal predecessors, (5499), 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-07-09 22:10:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 5499 transitions. [2021-07-09 22:10:27,843 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 5499 transitions. Word has length 75 [2021-07-09 22:10:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:27,843 INFO L482 AbstractCegarLoop]: Abstraction has 2279 states and 5499 transitions. [2021-07-09 22:10:27,843 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 5499 transitions. [2021-07-09 22:10:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 22:10:27,846 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:27,846 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:27,846 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 22:10:27,846 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -984661079, now seen corresponding path program 1 times [2021-07-09 22:10:27,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:27,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039592686] [2021-07-09 22:10:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:27,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:27,892 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:10:27,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:10:27,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:27,910 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:10:27,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:27,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:27,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:27,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:27,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039592686] [2021-07-09 22:10:27,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039592686] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:27,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:27,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:10:27,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153972805] [2021-07-09 22:10:27,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:10:27,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:10:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:10:27,921 INFO L87 Difference]: Start difference. First operand 2279 states and 5499 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:28,001 INFO L93 Difference]: Finished difference Result 2669 states and 6115 transitions. [2021-07-09 22:10:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:10:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-09 22:10:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:28,005 INFO L225 Difference]: With dead ends: 2669 [2021-07-09 22:10:28,005 INFO L226 Difference]: Without dead ends: 1853 [2021-07-09 22:10:28,006 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:10:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2021-07-09 22:10:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2021-07-09 22:10:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1823 states have (on average 2.4503565551289084) internal successors, (4467), 1852 states have internal predecessors, (4467), 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-07-09 22:10:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4467 transitions. [2021-07-09 22:10:28,040 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4467 transitions. Word has length 75 [2021-07-09 22:10:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:28,040 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4467 transitions. [2021-07-09 22:10:28,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4467 transitions. [2021-07-09 22:10:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 22:10:28,043 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:28,043 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:28,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 22:10:28,043 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -48811137, now seen corresponding path program 1 times [2021-07-09 22:10:28,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:28,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401851599] [2021-07-09 22:10:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:28,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:28,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:28,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:28,087 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:10:28,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:10:28,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:28,105 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:10:28,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:28,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:28,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:28,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401851599] [2021-07-09 22:10:28,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401851599] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:28,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:28,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:10:28,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829160480] [2021-07-09 22:10:28,113 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:10:28,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:10:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:10:28,113 INFO L87 Difference]: Start difference. First operand 1853 states and 4467 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:28,205 INFO L93 Difference]: Finished difference Result 1543 states and 3348 transitions. [2021-07-09 22:10:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:10:28,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-09 22:10:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:28,207 INFO L225 Difference]: With dead ends: 1543 [2021-07-09 22:10:28,207 INFO L226 Difference]: Without dead ends: 935 [2021-07-09 22:10:28,208 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 22:10:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-07-09 22:10:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 929. [2021-07-09 22:10:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 905 states have (on average 2.292817679558011) internal successors, (2075), 928 states have internal predecessors, (2075), 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-07-09 22:10:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2075 transitions. [2021-07-09 22:10:28,218 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2075 transitions. Word has length 76 [2021-07-09 22:10:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:28,219 INFO L482 AbstractCegarLoop]: Abstraction has 929 states and 2075 transitions. [2021-07-09 22:10:28,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2075 transitions. [2021-07-09 22:10:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-07-09 22:10:28,220 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:28,220 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:28,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 22:10:28,220 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1187839406, now seen corresponding path program 1 times [2021-07-09 22:10:28,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:28,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389345809] [2021-07-09 22:10:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:10:28,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:28,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:28,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:28,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:10:28,277 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:10:28,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:10:28,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:10:28,295 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:10:28,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:10:28,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:10:28,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:10:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:10:28,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:10:28,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389345809] [2021-07-09 22:10:28,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389345809] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:10:28,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:10:28,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 22:10:28,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995142724] [2021-07-09 22:10:28,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 22:10:28,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:10:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 22:10:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 22:10:28,303 INFO L87 Difference]: Start difference. First operand 929 states and 2075 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:10:28,398 INFO L93 Difference]: Finished difference Result 575 states and 1092 transitions. [2021-07-09 22:10:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:10:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-07-09 22:10:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:10:28,399 INFO L225 Difference]: With dead ends: 575 [2021-07-09 22:10:28,399 INFO L226 Difference]: Without dead ends: 278 [2021-07-09 22:10:28,399 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 83.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 22:10:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-07-09 22:10:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2021-07-09 22:10:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 265 states have (on average 1.849056603773585) internal successors, (490), 273 states have internal predecessors, (490), 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-07-09 22:10:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 490 transitions. [2021-07-09 22:10:28,402 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 490 transitions. Word has length 79 [2021-07-09 22:10:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:10:28,403 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 490 transitions. [2021-07-09 22:10:28,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:10:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 490 transitions. [2021-07-09 22:10:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 22:10:28,403 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:10:28,403 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:10:28,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 22:10:28,404 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:10:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:10:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1221871902, now seen corresponding path program 1 times [2021-07-09 22:10:28,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:10:28,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331322998] [2021-07-09 22:10:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:10:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:10:28,432 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:10:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:10:28,458 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:10:28,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 22:10:28,484 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 22:10:28,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 22:10:28,484 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 22:10:28,486 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 22:10:28,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 10:10:28 BasicIcfg [2021-07-09 22:10:28,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 22:10:28,566 INFO L168 Benchmark]: Toolchain (without parser) took 8363.07 ms. Allocated memory was 185.6 MB in the beginning and 548.4 MB in the end (delta: 362.8 MB). Free memory was 148.3 MB in the beginning and 144.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 367.3 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,566 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 185.6 MB. Free memory is still 166.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 22:10:28,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.08 ms. Allocated memory is still 185.6 MB. Free memory was 148.1 MB in the beginning and 155.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.22 ms. Allocated memory is still 185.6 MB. Free memory was 155.2 MB in the beginning and 152.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,566 INFO L168 Benchmark]: Boogie Preprocessor took 33.98 ms. Allocated memory is still 185.6 MB. Free memory was 152.1 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,566 INFO L168 Benchmark]: RCFGBuilder took 1489.64 ms. Allocated memory was 185.6 MB in the beginning and 233.8 MB in the end (delta: 48.2 MB). Free memory was 150.0 MB in the beginning and 171.9 MB in the end (delta: -21.9 MB). Peak memory consumption was 96.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,567 INFO L168 Benchmark]: TraceAbstraction took 6154.14 ms. Allocated memory was 233.8 MB in the beginning and 548.4 MB in the end (delta: 314.6 MB). Free memory was 171.3 MB in the beginning and 144.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 340.9 MB. Max. memory is 8.0 GB. [2021-07-09 22:10:28,567 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.39 ms. Allocated memory is still 185.6 MB. Free memory is still 166.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 636.08 ms. Allocated memory is still 185.6 MB. Free memory was 148.1 MB in the beginning and 155.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.22 ms. Allocated memory is still 185.6 MB. Free memory was 155.2 MB in the beginning and 152.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.98 ms. Allocated memory is still 185.6 MB. Free memory was 152.1 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1489.64 ms. Allocated memory was 185.6 MB in the beginning and 233.8 MB in the end (delta: 48.2 MB). Free memory was 150.0 MB in the beginning and 171.9 MB in the end (delta: -21.9 MB). Peak memory consumption was 96.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6154.14 ms. Allocated memory was 233.8 MB in the beginning and 548.4 MB in the end (delta: 314.6 MB). Free memory was 171.3 MB in the beginning and 144.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 340.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35801, positive: 33100, positive conditional: 33100, positive unconditional: 0, negative: 2701, negative conditional: 2701, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35173, positive: 33100, positive conditional: 0, positive unconditional: 33100, negative: 2073, negative conditional: 0, negative unconditional: 2073, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 882, positive: 837, positive conditional: 0, positive unconditional: 837, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 882, positive: 833, positive conditional: 0, positive unconditional: 833, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 406, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 401, negative conditional: 0, negative unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35173, positive: 32263, positive conditional: 0, positive unconditional: 32263, negative: 2028, negative conditional: 0, negative unconditional: 2028, unknown: 882, unknown conditional: 0, unknown unconditional: 882] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 837, Positive conditional cache size: 0, Positive unconditional cache size: 837, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Independence queries for same thread: 628 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2034; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2034, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2035; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2035, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2036; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2036, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5995.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 95.9ms, AutomataDifference: 2233.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 922.6ms, PartialOrderReductionTime: 913.1ms, HoareTripleCheckerStatistics: 1502 SDtfs, 2064 SDslu, 5215 SDs, 0 SdLazy, 823 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 670.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1435.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9815occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 782.1ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1242 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.4ms SsaConstructionTime, 470.4ms SatisfiabilityAnalysisTime, 1210.4ms InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 3682 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...