/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/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 22:07:56,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 22:07:56,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 22:07:56,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 22:07:56,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 22:07:56,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 22:07:56,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 22:07:56,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 22:07:56,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 22:07:56,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 22:07:56,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 22:07:56,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 22:07:56,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 22:07:56,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 22:07:56,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 22:07:56,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 22:07:56,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 22:07:56,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 22:07:56,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 22:07:56,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 22:07:56,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 22:07:56,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 22:07:56,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 22:07:56,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 22:07:56,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 22:07:56,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 22:07:56,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 22:07:56,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 22:07:56,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 22:07:56,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 22:07:56,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 22:07:56,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 22:07:56,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 22:07:56,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 22:07:56,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 22:07:56,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 22:07:56,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 22:07:56,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 22:07:56,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 22:07:56,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 22:07:56,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 22:07:56,420 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:07:56,443 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 22:07:56,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 22:07:56,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 22:07:56,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 22:07:56,444 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 22:07:56,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 22:07:56,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 22:07:56,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 22:07:56,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 22:07:56,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 22:07:56,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 22:07:56,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 22:07:56,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 22:07:56,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 22:07:56,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 22:07:56,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 22:07:56,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:07:56,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 22:07:56,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 22:07:56,448 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-09 22:07:56,449 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:07:56,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 22:07:56,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 22:07:56,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 22:07:56,741 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 22:07:56,741 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 22:07:56,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-07-09 22:07:56,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed278572/0bc7ecac3cfa4dbab78c1f9094901bd5/FLAGf447cb9a9 [2021-07-09 22:07:57,149 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 22:07:57,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-07-09 22:07:57,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed278572/0bc7ecac3cfa4dbab78c1f9094901bd5/FLAGf447cb9a9 [2021-07-09 22:07:57,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed278572/0bc7ecac3cfa4dbab78c1f9094901bd5 [2021-07-09 22:07:57,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 22:07:57,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 22:07:57,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 22:07:57,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 22:07:57,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 22:07:57,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:57,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204854ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57, skipping insertion in model container [2021-07-09 22:07:57,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:57,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 22:07:57,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 22:07:57,697 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/rfi000_rmo.opt.i[948,961] [2021-07-09 22:07:57,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:07:57,870 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 22:07:57,877 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/rfi000_rmo.opt.i[948,961] [2021-07-09 22:07:57,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:07:57,935 INFO L208 MainTranslator]: Completed translation [2021-07-09 22:07:57,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57 WrapperNode [2021-07-09 22:07:57,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 22:07:57,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 22:07:57,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 22:07:57,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 22:07:57,942 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:07:57" (1/1) ... [2021-07-09 22:07:57,978 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:07:57" (1/1) ... [2021-07-09 22:07:57,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 22:07:57,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 22:07:57,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 22:07:57,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 22:07:58,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... [2021-07-09 22:07:58,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 22:07:58,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 22:07:58,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 22:07:58,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 22:07:58,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 22:07:58,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 22:07:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 22:07:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 22:07:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 22:07:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 22:07:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 22:07:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 22:07:58,091 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:07:59,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 22:07:59,347 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 22:07:59,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:07:59 BoogieIcfgContainer [2021-07-09 22:07:59,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 22:07:59,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 22:07:59,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 22:07:59,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 22:07:59,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 10:07:57" (1/3) ... [2021-07-09 22:07:59,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b92488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:07:59, skipping insertion in model container [2021-07-09 22:07:59,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:07:57" (2/3) ... [2021-07-09 22:07:59,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b92488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:07:59, skipping insertion in model container [2021-07-09 22:07:59,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:07:59" (3/3) ... [2021-07-09 22:07:59,354 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2021-07-09 22:07:59,358 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 22:07:59,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 22:07:59,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 22:07:59,359 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 22:07:59,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,400 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,400 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:07:59,401 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 22:07:59,420 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 22:07:59,441 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 22:07:59,441 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 22:07:59,441 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 22:07:59,441 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 22:07:59,441 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 22:07:59,441 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 22:07:59,441 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 22:07:59,441 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-07-09 22:07:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 693 states, 675 states have (on average 1.6696296296296296) internal successors, (1127), 692 states have internal predecessors, (1127), 0 states have call successors, (0), 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:07:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-07-09 22:07:59,725 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:07:59,726 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] [2021-07-09 22:07:59,726 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:07:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:07:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 581779579, now seen corresponding path program 1 times [2021-07-09 22:07:59,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:07:59,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674168923] [2021-07-09 22:07:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:07:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:07:59,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:07:59,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:07:59,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:07:59,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:07:59,967 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:07:59,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:07:59,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674168923] [2021-07-09 22:07:59,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674168923] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:07:59,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:07:59,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 22:07:59,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442909538] [2021-07-09 22:07:59,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 22:07:59,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:07:59,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 22:07:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 22:07:59,980 INFO L87 Difference]: Start difference. First operand has 693 states, 675 states have (on average 1.6696296296296296) internal successors, (1127), 692 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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:08:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:00,017 INFO L93 Difference]: Finished difference Result 477 states and 690 transitions. [2021-07-09 22:08:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 22:08:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-07-09 22:08:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:00,022 INFO L225 Difference]: With dead ends: 477 [2021-07-09 22:08:00,022 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 22:08:00,023 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 22:08:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 22:08:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 22:08:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:08:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 22:08:00,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2021-07-09 22:08:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:00,037 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 22:08:00,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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:08:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 22:08:00,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 22:08:00,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 22:08:00,038 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 22:08:00,039 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-09 22:08:00,040 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 22:08:00,040 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 22:08:00,040 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 22:08:00,040 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 22:08:00,040 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 22:08:00,040 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 22:08:00,040 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 22:08:00,041 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 22:08:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 1501 states, 1332 states have (on average 1.9496996996996998) internal successors, (2597), 1500 states have internal predecessors, (2597), 0 states have call successors, (0), 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:08:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 22:08:00,391 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:00,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] [2021-07-09 22:08:00,391 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1072851851, now seen corresponding path program 1 times [2021-07-09 22:08:00,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:00,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207820470] [2021-07-09 22:08:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:00,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:00,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:00,558 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:08:00,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:00,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:00,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:00,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:00,590 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:08:00,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:00,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207820470] [2021-07-09 22:08:00,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207820470] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:00,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:00,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:08:00,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946065804] [2021-07-09 22:08:00,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:08:00,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:08:00,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:08:00,594 INFO L87 Difference]: Start difference. First operand has 1501 states, 1332 states have (on average 1.9496996996996998) internal successors, (2597), 1500 states have internal predecessors, (2597), 0 states have call successors, (0), 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 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:00,679 INFO L93 Difference]: Finished difference Result 1613 states and 2745 transitions. [2021-07-09 22:08:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:08:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-09 22:08:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:00,686 INFO L225 Difference]: With dead ends: 1613 [2021-07-09 22:08:00,687 INFO L226 Difference]: Without dead ends: 702 [2021-07-09 22:08:00,687 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:08:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-07-09 22:08:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2021-07-09 22:08:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 694 states have (on average 1.8804034582132565) internal successors, (1305), 701 states have internal predecessors, (1305), 0 states have call successors, (0), 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:08:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1305 transitions. [2021-07-09 22:08:00,724 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1305 transitions. Word has length 58 [2021-07-09 22:08:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:00,724 INFO L482 AbstractCegarLoop]: Abstraction has 702 states and 1305 transitions. [2021-07-09 22:08:00,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1305 transitions. [2021-07-09 22:08:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 22:08:00,726 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:00,726 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] [2021-07-09 22:08:00,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 22:08:00,726 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -398301352, now seen corresponding path program 1 times [2021-07-09 22:08:00,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:00,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688232356] [2021-07-09 22:08:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:00,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:00,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:00,798 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:08:00,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:00,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:00,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:00,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:00,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:00,826 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:08:00,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:00,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688232356] [2021-07-09 22:08:00,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688232356] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:00,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:00,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:08:00,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731848779] [2021-07-09 22:08:00,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:08:00,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:08:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:08:00,828 INFO L87 Difference]: Start difference. First operand 702 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:00,905 INFO L93 Difference]: Finished difference Result 782 states and 1469 transitions. [2021-07-09 22:08:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:08:00,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-07-09 22:08:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:00,909 INFO L225 Difference]: With dead ends: 782 [2021-07-09 22:08:00,909 INFO L226 Difference]: Without dead ends: 654 [2021-07-09 22:08:00,913 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:08:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-07-09 22:08:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2021-07-09 22:08:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 646 states have (on average 1.8157894736842106) internal successors, (1173), 653 states have internal predecessors, (1173), 0 states have call successors, (0), 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:08:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1173 transitions. [2021-07-09 22:08:00,934 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1173 transitions. Word has length 62 [2021-07-09 22:08:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:00,935 INFO L482 AbstractCegarLoop]: Abstraction has 654 states and 1173 transitions. [2021-07-09 22:08:00,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1173 transitions. [2021-07-09 22:08:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-09 22:08:00,937 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:00,937 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] [2021-07-09 22:08:00,937 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 22:08:00,938 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1444688164, now seen corresponding path program 1 times [2021-07-09 22:08:00,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:00,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702645468] [2021-07-09 22:08:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:01,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:01,034 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:08:01,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:01,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,058 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:08:01,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:01,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702645468] [2021-07-09 22:08:01,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702645468] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:01,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:01,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:08:01,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321635453] [2021-07-09 22:08:01,058 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:08:01,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:08:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:08:01,059 INFO L87 Difference]: Start difference. First operand 654 states and 1173 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:01,166 INFO L93 Difference]: Finished difference Result 992 states and 1884 transitions. [2021-07-09 22:08:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:08:01,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-09 22:08:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:01,168 INFO L225 Difference]: With dead ends: 992 [2021-07-09 22:08:01,168 INFO L226 Difference]: Without dead ends: 425 [2021-07-09 22:08:01,168 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 89.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:08:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-07-09 22:08:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2021-07-09 22:08:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 419 states have (on average 1.902147971360382) internal successors, (797), 424 states have internal predecessors, (797), 0 states have call successors, (0), 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:08:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 797 transitions. [2021-07-09 22:08:01,174 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 797 transitions. Word has length 63 [2021-07-09 22:08:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:01,175 INFO L482 AbstractCegarLoop]: Abstraction has 425 states and 797 transitions. [2021-07-09 22:08:01,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 797 transitions. [2021-07-09 22:08:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-09 22:08:01,176 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:01,176 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] [2021-07-09 22:08:01,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 22:08:01,176 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash 280319157, now seen corresponding path program 1 times [2021-07-09 22:08:01,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:01,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544896791] [2021-07-09 22:08:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:01,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:01,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:08:01,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:08:01,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-09 22:08:01,283 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-07-09 22:08:01,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-07-09 22:08:01,305 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:08:01,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:01,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,338 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:08:01,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:01,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544896791] [2021-07-09 22:08:01,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544896791] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:01,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:01,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 22:08:01,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516122473] [2021-07-09 22:08:01,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 22:08:01,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 22:08:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-09 22:08:01,340 INFO L87 Difference]: Start difference. First operand 425 states and 797 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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:08:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:01,531 INFO L93 Difference]: Finished difference Result 491 states and 942 transitions. [2021-07-09 22:08:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 22:08:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-07-09 22:08:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:01,533 INFO L225 Difference]: With dead ends: 491 [2021-07-09 22:08:01,533 INFO L226 Difference]: Without dead ends: 419 [2021-07-09 22:08:01,533 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 148.0ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-07-09 22:08:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-07-09 22:08:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-07-09 22:08:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 413 states have (on average 1.8861985472154963) internal successors, (779), 418 states have internal predecessors, (779), 0 states have call successors, (0), 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:08:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 779 transitions. [2021-07-09 22:08:01,540 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 779 transitions. Word has length 65 [2021-07-09 22:08:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:01,540 INFO L482 AbstractCegarLoop]: Abstraction has 419 states and 779 transitions. [2021-07-09 22:08:01,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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:08:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 779 transitions. [2021-07-09 22:08:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-09 22:08:01,541 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:01,541 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] [2021-07-09 22:08:01,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 22:08:01,541 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -739872736, now seen corresponding path program 1 times [2021-07-09 22:08:01,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:01,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716634551] [2021-07-09 22:08:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:01,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:01,599 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:08:01,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:08:01,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:08:01,620 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:08:01,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,627 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:08:01,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:01,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716634551] [2021-07-09 22:08:01,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716634551] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:01,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:01,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:08:01,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019029724] [2021-07-09 22:08:01,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:08:01,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:08:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:08:01,628 INFO L87 Difference]: Start difference. First operand 419 states and 779 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:01,692 INFO L93 Difference]: Finished difference Result 423 states and 733 transitions. [2021-07-09 22:08:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:08:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-09 22:08:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:01,693 INFO L225 Difference]: With dead ends: 423 [2021-07-09 22:08:01,693 INFO L226 Difference]: Without dead ends: 275 [2021-07-09 22:08:01,693 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:08:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-07-09 22:08:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-07-09 22:08:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 269 states have (on average 1.7657992565055762) internal successors, (475), 274 states have internal predecessors, (475), 0 states have call successors, (0), 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:08:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 475 transitions. [2021-07-09 22:08:01,697 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 475 transitions. Word has length 66 [2021-07-09 22:08:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:01,698 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 475 transitions. [2021-07-09 22:08:01,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:08:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 475 transitions. [2021-07-09 22:08:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 22:08:01,699 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:01,699 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:08:01,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 22:08:01,699 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash 591430922, now seen corresponding path program 1 times [2021-07-09 22:08:01,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:01,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711977900] [2021-07-09 22:08:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:01,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:01,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:01,800 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:08:01,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:08:01,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:08:01,834 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:08:01,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:01,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:01,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:01,843 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:08:01,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:01,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711977900] [2021-07-09 22:08:01,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711977900] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:01,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:01,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:08:01,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702148959] [2021-07-09 22:08:01,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:08:01,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:08:01,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:08:01,847 INFO L87 Difference]: Start difference. First operand 275 states and 475 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:08:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:01,934 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2021-07-09 22:08:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:08:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:08:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:01,935 INFO L225 Difference]: With dead ends: 197 [2021-07-09 22:08:01,935 INFO L226 Difference]: Without dead ends: 122 [2021-07-09 22:08:01,935 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 22:08:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-07-09 22:08:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-07-09 22:08:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.361344537815126) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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:08:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2021-07-09 22:08:01,937 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 67 [2021-07-09 22:08:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:01,938 INFO L482 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-07-09 22:08:01,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:08:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2021-07-09 22:08:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 22:08:01,938 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:01,938 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:08:01,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 22:08:01,938 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:01,939 INFO L82 PathProgramCache]: Analyzing trace with hash 737464373, now seen corresponding path program 1 times [2021-07-09 22:08:01,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:01,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752868079] [2021-07-09 22:08:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:08:02,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:02,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:08:02,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:08:02,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:08:02,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-09 22:08:02,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:02,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-09 22:08:02,057 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-09 22:08:02,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-09 22:08:02,074 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:08:02,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:08:02,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:02,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:08:02,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:08:02,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:08:02,109 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:08:02,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:08:02,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752868079] [2021-07-09 22:08:02,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752868079] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:08:02,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:08:02,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 22:08:02,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12141083] [2021-07-09 22:08:02,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 22:08:02,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:08:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 22:08:02,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-07-09 22:08:02,110 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:08:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:08:02,245 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2021-07-09 22:08:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:08:02,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:08:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:08:02,246 INFO L225 Difference]: With dead ends: 160 [2021-07-09 22:08:02,246 INFO L226 Difference]: Without dead ends: 121 [2021-07-09 22:08:02,247 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 129.1ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-07-09 22:08:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-07-09 22:08:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-07-09 22:08:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 120 states have internal predecessors, (160), 0 states have call successors, (0), 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:08:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-07-09 22:08:02,249 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 70 [2021-07-09 22:08:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:08:02,249 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-07-09 22:08:02,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:08:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-07-09 22:08:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 22:08:02,249 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:08:02,249 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:08:02,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 22:08:02,250 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:08:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:08:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1710018239, now seen corresponding path program 2 times [2021-07-09 22:08:02,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:08:02,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003010902] [2021-07-09 22:08:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:08:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:08:02,279 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:08:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:08:02,302 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:08:02,324 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 22:08:02,324 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 22:08:02,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 22:08:02,324 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 22:08:02,325 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 22:08:02,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 10:08:02 BasicIcfg [2021-07-09 22:08:02,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 22:08:02,400 INFO L168 Benchmark]: Toolchain (without parser) took 4845.65 ms. Allocated memory was 196.1 MB in the beginning and 268.4 MB in the end (delta: 72.4 MB). Free memory was 158.6 MB in the beginning and 94.7 MB in the end (delta: 63.9 MB). Peak memory consumption was 135.8 MB. Max. memory is 8.0 GB. [2021-07-09 22:08:02,405 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 196.1 MB. Free memory is still 176.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 22:08:02,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.95 ms. Allocated memory is still 196.1 MB. Free memory was 158.4 MB in the beginning and 166.3 MB in the end (delta: -7.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-09 22:08:02,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.49 ms. Allocated memory is still 196.1 MB. Free memory was 166.3 MB in the beginning and 163.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:08:02,406 INFO L168 Benchmark]: Boogie Preprocessor took 18.30 ms. Allocated memory is still 196.1 MB. Free memory was 163.7 MB in the beginning and 161.6 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:08:02,408 INFO L168 Benchmark]: RCFGBuilder took 1333.02 ms. Allocated memory was 196.1 MB in the beginning and 268.4 MB in the end (delta: 72.4 MB). Free memory was 161.6 MB in the beginning and 243.7 MB in the end (delta: -82.2 MB). Peak memory consumption was 103.9 MB. Max. memory is 8.0 GB. [2021-07-09 22:08:02,408 INFO L168 Benchmark]: TraceAbstraction took 3050.14 ms. Allocated memory is still 268.4 MB. Free memory was 243.2 MB in the beginning and 94.7 MB in the end (delta: 148.5 MB). Peak memory consumption was 148.5 MB. Max. memory is 8.0 GB. [2021-07-09 22:08:02,412 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.38 ms. Allocated memory is still 196.1 MB. Free memory is still 176.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 379.95 ms. Allocated memory is still 196.1 MB. Free memory was 158.4 MB in the beginning and 166.3 MB in the end (delta: -7.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.49 ms. Allocated memory is still 196.1 MB. Free memory was 166.3 MB in the beginning and 163.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 18.30 ms. Allocated memory is still 196.1 MB. Free memory was 163.7 MB in the beginning and 161.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1333.02 ms. Allocated memory was 196.1 MB in the beginning and 268.4 MB in the end (delta: 72.4 MB). Free memory was 161.6 MB in the beginning and 243.7 MB in the end (delta: -82.2 MB). Peak memory consumption was 103.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3050.14 ms. Allocated memory is still 268.4 MB. Free memory was 243.2 MB in the beginning and 94.7 MB in the end (delta: 148.5 MB). Peak memory consumption was 148.5 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: 1326, positive: 1203, positive conditional: 1203, positive unconditional: 0, negative: 123, negative conditional: 123, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1254, positive: 1203, positive conditional: 0, positive unconditional: 1203, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 319, positive: 308, positive conditional: 0, positive unconditional: 308, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 319, positive: 308, positive conditional: 0, positive unconditional: 308, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1254, positive: 895, positive conditional: 0, positive unconditional: 895, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 319, unknown conditional: 0, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 308, Positive conditional cache size: 0, Positive unconditional cache size: 308, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Independence queries for same thread: 72 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3373, positive: 2989, positive conditional: 2989, positive unconditional: 0, negative: 384, negative conditional: 384, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3229, positive: 2989, positive conditional: 0, positive unconditional: 2989, negative: 240, negative conditional: 0, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 463, positive: 434, positive conditional: 0, positive unconditional: 434, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 463, positive: 433, positive conditional: 0, positive unconditional: 433, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 243, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 242, negative conditional: 0, negative unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3229, positive: 2555, positive conditional: 0, positive unconditional: 2555, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 463, unknown conditional: 0, unknown unconditional: 463] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 434, Positive conditional cache size: 0, Positive unconditional cache size: 434, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Independence queries for same thread: 144 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 0 pthread_t t1595; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] FCALL, FORK 0 pthread_create(&t1595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1596; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L744] 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) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] 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) [L744] 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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 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 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 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) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 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 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 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) [L820] 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) [L821] 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)) [L821] 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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] 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) [L822] 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)) [L822] 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)) [L823] 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)) [L823] 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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] 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) [L824] 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)) [L824] 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)) [L825] 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)) [L825] 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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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) [L826] 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)) [L826] 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)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 599.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 10.7ms, AutomataDifference: 52.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 273.3ms, PartialOrderReductionTime: 257.3ms, HoareTripleCheckerStatistics: 72 SDtfs, 27 SDslu, 24 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.9ms SsaConstructionTime, 55.3ms SatisfiabilityAnalysisTime, 110.9ms InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2284.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 15.8ms, AutomataDifference: 772.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 340.8ms, PartialOrderReductionTime: 339.7ms, HoareTripleCheckerStatistics: 660 SDtfs, 633 SDslu, 2253 SDs, 0 SdLazy, 306 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 259.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 646.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1501occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 78.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.0ms SsaConstructionTime, 252.0ms SatisfiabilityAnalysisTime, 686.8ms InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...