/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/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 00:19:45,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 00:19:45,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 00:19:45,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 00:19:45,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 00:19:45,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 00:19:45,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 00:19:45,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 00:19:45,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 00:19:45,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 00:19:45,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 00:19:45,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 00:19:45,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 00:19:45,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 00:19:45,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 00:19:45,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 00:19:45,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 00:19:45,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 00:19:45,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 00:19:45,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 00:19:45,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 00:19:45,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 00:19:45,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 00:19:45,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 00:19:45,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 00:19:45,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 00:19:45,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 00:19:45,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 00:19:45,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 00:19:45,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 00:19:45,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 00:19:45,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 00:19:45,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 00:19:45,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 00:19:45,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 00:19:45,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 00:19:45,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 00:19:45,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 00:19:45,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 00:19:45,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 00:19:45,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 00:19:45,563 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-14 00:19:45,597 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 00:19:45,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 00:19:45,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 00:19:45,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 00:19:45,601 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 00:19:45,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 00:19:45,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 00:19:45,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 00:19:45,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 00:19:45,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 00:19:45,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 00:19:45,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 00:19:45,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 00:19:45,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 00:19:45,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 00:19:45,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 00:19:45,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:19:45,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 00:19:45,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 00:19:45,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 00:19:45,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 00:19:45,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 00:19:45,625 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 00:19:45,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 00:19:45,625 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-14 00:19:45,625 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-14 00:19:45,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 00:19:45,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 00:19:45,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 00:19:45,915 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-14 00:19:45,915 INFO L275 PluginConnector]: CDTParser initialized [2021-07-14 00:19:45,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-07-14 00:19:45,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825c1cf90/ba23874807b542b8a85e5932484a9df1/FLAG926ec7d36 [2021-07-14 00:19:46,499 INFO L306 CDTParser]: Found 1 translation units. [2021-07-14 00:19:46,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-07-14 00:19:46,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825c1cf90/ba23874807b542b8a85e5932484a9df1/FLAG926ec7d36 [2021-07-14 00:19:46,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825c1cf90/ba23874807b542b8a85e5932484a9df1 [2021-07-14 00:19:46,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 00:19:46,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-14 00:19:46,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-14 00:19:46,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-14 00:19:46,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-14 00:19:46,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:19:46" (1/1) ... [2021-07-14 00:19:46,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634dfc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:46, skipping insertion in model container [2021-07-14 00:19:46,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:19:46" (1/1) ... [2021-07-14 00:19:46,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-14 00:19:46,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-14 00:19:47,007 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i[949,962] [2021-07-14 00:19:47,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:19:47,270 INFO L203 MainTranslator]: Completed pre-run [2021-07-14 00:19:47,283 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i[949,962] [2021-07-14 00:19:47,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:19:47,383 INFO L208 MainTranslator]: Completed translation [2021-07-14 00:19:47,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47 WrapperNode [2021-07-14 00:19:47,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-14 00:19:47,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 00:19:47,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 00:19:47,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 00:19:47,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 00:19:47,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 00:19:47,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 00:19:47,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 00:19:47,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (1/1) ... [2021-07-14 00:19:47,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 00:19:47,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 00:19:47,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 00:19:47,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 00:19:47,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (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-14 00:19:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-14 00:19:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-14 00:19:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-14 00:19:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-14 00:19:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-14 00:19:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-14 00:19:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-14 00:19:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-14 00:19:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-14 00:19:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-14 00:19:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 00:19:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 00:19:47,556 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 00:19:48,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 00:19:48,989 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-14 00:19:48,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:19:48 BoogieIcfgContainer [2021-07-14 00:19:48,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 00:19:48,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 00:19:48,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 00:19:48,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 00:19:48,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:19:46" (1/3) ... [2021-07-14 00:19:48,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228a7b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:19:48, skipping insertion in model container [2021-07-14 00:19:48,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:19:47" (2/3) ... [2021-07-14 00:19:48,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228a7b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:19:48, skipping insertion in model container [2021-07-14 00:19:48,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:19:48" (3/3) ... [2021-07-14 00:19:48,999 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2021-07-14 00:19:49,006 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 00:19:49,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 00:19:49,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-14 00:19:49,007 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 00:19:49,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,041 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,048 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:19:49,055 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-14 00:19:49,076 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-14 00:19:49,099 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:19:49,099 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:19:49,099 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:19:49,099 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:19:49,099 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:19:49,099 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:19:49,100 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:19:49,100 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-07-14 00:19:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 691 states, 673 states have (on average 1.6716196136701338) internal successors, (1125), 690 states have internal predecessors, (1125), 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-14 00:19:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-07-14 00:19:49,411 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:49,411 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] [2021-07-14 00:19:49,412 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash 100820283, now seen corresponding path program 1 times [2021-07-14 00:19:49,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:49,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579957419] [2021-07-14 00:19:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:49,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:49,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:49,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:49,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:49,698 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-14 00:19:49,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:49,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579957419] [2021-07-14 00:19:49,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579957419] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:49,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:49,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-14 00:19:49,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641703749] [2021-07-14 00:19:49,703 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 00:19:49,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 00:19:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 00:19:49,718 INFO L87 Difference]: Start difference. First operand has 691 states, 673 states have (on average 1.6716196136701338) internal successors, (1125), 690 states have internal predecessors, (1125), 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 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-14 00:19:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:49,774 INFO L93 Difference]: Finished difference Result 475 states and 688 transitions. [2021-07-14 00:19:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 00:19:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-07-14 00:19:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:49,781 INFO L225 Difference]: With dead ends: 475 [2021-07-14 00:19:49,781 INFO L226 Difference]: Without dead ends: 0 [2021-07-14 00:19:49,782 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 00:19:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-14 00:19:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-14 00:19:49,800 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-14 00:19:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-14 00:19:49,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-07-14 00:19:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:49,801 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-14 00:19:49,802 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-14 00:19:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-14 00:19:49,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-14 00:19:49,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 00:19:49,802 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2021-07-14 00:19:49,804 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-14 00:19:49,814 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:19:49,814 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:19:49,814 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:19:49,814 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:19:49,814 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:19:49,814 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:19:49,815 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:19:49,815 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-14 00:19:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 1243 states, 1074 states have (on average 1.8910614525139664) internal successors, (2031), 1242 states have internal predecessors, (2031), 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-14 00:19:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-14 00:19:50,212 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:50,212 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] [2021-07-14 00:19:50,213 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash 453548779, now seen corresponding path program 1 times [2021-07-14 00:19:50,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:50,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729549613] [2021-07-14 00:19:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:50,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:50,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:50,400 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:50,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:50,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:50,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:50,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:50,442 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-14 00:19:50,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:50,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729549613] [2021-07-14 00:19:50,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729549613] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:50,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:50,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:19:50,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552814648] [2021-07-14 00:19:50,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:19:50,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:50,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:19:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:19:50,447 INFO L87 Difference]: Start difference. First operand has 1243 states, 1074 states have (on average 1.8910614525139664) internal successors, (2031), 1242 states have internal predecessors, (2031), 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.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:50,584 INFO L93 Difference]: Finished difference Result 1483 states and 2459 transitions. [2021-07-14 00:19:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:19:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-14 00:19:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:50,594 INFO L225 Difference]: With dead ends: 1483 [2021-07-14 00:19:50,595 INFO L226 Difference]: Without dead ends: 711 [2021-07-14 00:19:50,595 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:19:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-07-14 00:19:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2021-07-14 00:19:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 702 states have (on average 1.9173789173789173) internal successors, (1346), 710 states have internal predecessors, (1346), 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-14 00:19:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1346 transitions. [2021-07-14 00:19:50,647 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1346 transitions. Word has length 56 [2021-07-14 00:19:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:50,647 INFO L482 AbstractCegarLoop]: Abstraction has 711 states and 1346 transitions. [2021-07-14 00:19:50,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1346 transitions. [2021-07-14 00:19:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-14 00:19:50,649 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:50,650 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-14 00:19:50,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 00:19:50,650 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:50,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1802447596, now seen corresponding path program 1 times [2021-07-14 00:19:50,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:50,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644817753] [2021-07-14 00:19:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:50,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:50,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:50,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:50,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:19:50,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:19:50,815 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-07-14 00:19:50,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-14 00:19:50,832 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:50,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:50,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:50,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:50,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:50,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:50,925 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-14 00:19:50,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:50,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644817753] [2021-07-14 00:19:50,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644817753] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:50,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:50,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-14 00:19:50,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063965668] [2021-07-14 00:19:50,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-14 00:19:50,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-14 00:19:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-14 00:19:50,928 INFO L87 Difference]: Start difference. First operand 711 states and 1346 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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-14 00:19:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:51,223 INFO L93 Difference]: Finished difference Result 855 states and 1640 transitions. [2021-07-14 00:19:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-14 00:19:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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-14 00:19:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:51,227 INFO L225 Difference]: With dead ends: 855 [2021-07-14 00:19:51,227 INFO L226 Difference]: Without dead ends: 667 [2021-07-14 00:19:51,228 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 267.4ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-14 00:19:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-07-14 00:19:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-07-14 00:19:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 658 states have (on average 1.8753799392097263) internal successors, (1234), 666 states have internal predecessors, (1234), 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-14 00:19:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1234 transitions. [2021-07-14 00:19:51,248 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1234 transitions. Word has length 58 [2021-07-14 00:19:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:51,248 INFO L482 AbstractCegarLoop]: Abstraction has 667 states and 1234 transitions. [2021-07-14 00:19:51,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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-14 00:19:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1234 transitions. [2021-07-14 00:19:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-14 00:19:51,250 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:51,250 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] [2021-07-14 00:19:51,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 00:19:51,251 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1377600562, now seen corresponding path program 1 times [2021-07-14 00:19:51,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:51,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109392343] [2021-07-14 00:19:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:51,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:51,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:51,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:51,338 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-07-14 00:19:51,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-14 00:19:51,349 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:19:51,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:19:51,368 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:51,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:51,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:51,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:51,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:51,405 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-14 00:19:51,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:51,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109392343] [2021-07-14 00:19:51,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109392343] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:51,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:51,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-14 00:19:51,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570682596] [2021-07-14 00:19:51,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-14 00:19:51,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:51,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-14 00:19:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-14 00:19:51,407 INFO L87 Difference]: Start difference. First operand 667 states and 1234 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-14 00:19:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:51,703 INFO L93 Difference]: Finished difference Result 734 states and 1350 transitions. [2021-07-14 00:19:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 00:19:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 59 [2021-07-14 00:19:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:51,707 INFO L225 Difference]: With dead ends: 734 [2021-07-14 00:19:51,708 INFO L226 Difference]: Without dead ends: 614 [2021-07-14 00:19:51,708 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-07-14 00:19:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-07-14 00:19:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 613. [2021-07-14 00:19:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 605 states have (on average 1.8165289256198347) internal successors, (1099), 612 states have internal predecessors, (1099), 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-14 00:19:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1099 transitions. [2021-07-14 00:19:51,721 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1099 transitions. Word has length 59 [2021-07-14 00:19:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:51,722 INFO L482 AbstractCegarLoop]: Abstraction has 613 states and 1099 transitions. [2021-07-14 00:19:51,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-14 00:19:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1099 transitions. [2021-07-14 00:19:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-14 00:19:51,723 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:51,723 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] [2021-07-14 00:19:51,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 00:19:51,724 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:51,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:51,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1628271010, now seen corresponding path program 2 times [2021-07-14 00:19:51,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:51,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835557894] [2021-07-14 00:19:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:51,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:51,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:51,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:51,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:19:51,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:19:51,875 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-07-14 00:19:51,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-14 00:19:51,889 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:51,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:51,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:51,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:51,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:51,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:51,930 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-14 00:19:51,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:51,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835557894] [2021-07-14 00:19:51,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835557894] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:51,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:51,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-14 00:19:51,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043833979] [2021-07-14 00:19:51,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-14 00:19:51,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-14 00:19:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-14 00:19:51,932 INFO L87 Difference]: Start difference. First operand 613 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-14 00:19:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:52,254 INFO L93 Difference]: Finished difference Result 721 states and 1325 transitions. [2021-07-14 00:19:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-14 00:19:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 59 [2021-07-14 00:19:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:52,258 INFO L225 Difference]: With dead ends: 721 [2021-07-14 00:19:52,258 INFO L226 Difference]: Without dead ends: 601 [2021-07-14 00:19:52,259 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 231.9ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-07-14 00:19:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-07-14 00:19:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2021-07-14 00:19:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 592 states have (on average 1.8125) internal successors, (1073), 599 states have internal predecessors, (1073), 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-14 00:19:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1073 transitions. [2021-07-14 00:19:52,271 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1073 transitions. Word has length 59 [2021-07-14 00:19:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:52,271 INFO L482 AbstractCegarLoop]: Abstraction has 600 states and 1073 transitions. [2021-07-14 00:19:52,271 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-14 00:19:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1073 transitions. [2021-07-14 00:19:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-14 00:19:52,273 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:52,273 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] [2021-07-14 00:19:52,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 00:19:52,273 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1402904626, now seen corresponding path program 1 times [2021-07-14 00:19:52,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:52,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156468482] [2021-07-14 00:19:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:52,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:52,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:52,362 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:52,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:52,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:52,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:52,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:52,393 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-14 00:19:52,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:52,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156468482] [2021-07-14 00:19:52,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156468482] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:52,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:52,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:19:52,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555970635] [2021-07-14 00:19:52,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:19:52,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:19:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:19:52,395 INFO L87 Difference]: Start difference. First operand 600 states and 1073 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:52,495 INFO L93 Difference]: Finished difference Result 930 states and 1767 transitions. [2021-07-14 00:19:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:19:52,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-14 00:19:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:52,498 INFO L225 Difference]: With dead ends: 930 [2021-07-14 00:19:52,498 INFO L226 Difference]: Without dead ends: 583 [2021-07-14 00:19:52,499 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:19:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-07-14 00:19:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 483. [2021-07-14 00:19:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.8134171907756813) internal successors, (865), 482 states have internal predecessors, (865), 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-14 00:19:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 865 transitions. [2021-07-14 00:19:52,509 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 865 transitions. Word has length 60 [2021-07-14 00:19:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:52,509 INFO L482 AbstractCegarLoop]: Abstraction has 483 states and 865 transitions. [2021-07-14 00:19:52,509 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 865 transitions. [2021-07-14 00:19:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-14 00:19:52,510 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:52,510 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] [2021-07-14 00:19:52,511 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 00:19:52,511 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1979748077, now seen corresponding path program 1 times [2021-07-14 00:19:52,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:52,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98371219] [2021-07-14 00:19:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:52,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:52,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:52,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:19:52,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:19:52,672 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-14 00:19:52,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-14 00:19:52,685 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:52,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:52,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:52,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:52,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:52,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:52,727 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-14 00:19:52,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:52,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98371219] [2021-07-14 00:19:52,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98371219] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:52,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:52,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-14 00:19:52,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479839330] [2021-07-14 00:19:52,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-14 00:19:52,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-14 00:19:52,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-14 00:19:52,729 INFO L87 Difference]: Start difference. First operand 483 states and 865 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:52,930 INFO L93 Difference]: Finished difference Result 533 states and 986 transitions. [2021-07-14 00:19:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-14 00:19:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-14 00:19:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:52,932 INFO L225 Difference]: With dead ends: 533 [2021-07-14 00:19:52,933 INFO L226 Difference]: Without dead ends: 437 [2021-07-14 00:19:52,933 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 157.6ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-07-14 00:19:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-07-14 00:19:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2021-07-14 00:19:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 429 states have (on average 1.8344988344988344) internal successors, (787), 434 states have internal predecessors, (787), 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-14 00:19:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 787 transitions. [2021-07-14 00:19:52,943 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 787 transitions. Word has length 60 [2021-07-14 00:19:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:52,944 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 787 transitions. [2021-07-14 00:19:52,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 787 transitions. [2021-07-14 00:19:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-14 00:19:52,945 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:52,945 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] [2021-07-14 00:19:52,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-14 00:19:52,945 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1417153900, now seen corresponding path program 1 times [2021-07-14 00:19:52,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:52,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16160031] [2021-07-14 00:19:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:53,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:53,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:53,024 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-07-14 00:19:53,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-14 00:19:53,036 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:19:53,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:19:53,058 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-07-14 00:19:53,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-07-14 00:19:53,089 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:53,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:53,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:53,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:53,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,128 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-14 00:19:53,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:53,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16160031] [2021-07-14 00:19:53,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16160031] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:53,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:53,128 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-14 00:19:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990953994] [2021-07-14 00:19:53,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-14 00:19:53,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-14 00:19:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-14 00:19:53,130 INFO L87 Difference]: Start difference. First operand 435 states and 787 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:53,355 INFO L93 Difference]: Finished difference Result 518 states and 976 transitions. [2021-07-14 00:19:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-14 00:19:53,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-07-14 00:19:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:53,358 INFO L225 Difference]: With dead ends: 518 [2021-07-14 00:19:53,358 INFO L226 Difference]: Without dead ends: 438 [2021-07-14 00:19:53,359 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-07-14 00:19:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-07-14 00:19:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2021-07-14 00:19:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 432 states have (on average 1.8310185185185186) internal successors, (791), 437 states have internal predecessors, (791), 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-14 00:19:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 791 transitions. [2021-07-14 00:19:53,369 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 791 transitions. Word has length 61 [2021-07-14 00:19:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:53,369 INFO L482 AbstractCegarLoop]: Abstraction has 438 states and 791 transitions. [2021-07-14 00:19:53,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 791 transitions. [2021-07-14 00:19:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-14 00:19:53,370 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:53,370 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] [2021-07-14 00:19:53,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 00:19:53,371 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -296429424, now seen corresponding path program 2 times [2021-07-14 00:19:53,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:53,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899040007] [2021-07-14 00:19:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:53,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:53,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:53,439 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-07-14 00:19:53,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-14 00:19:53,446 INFO L142 QuantifierPusher]: treesize reduction 36, result has 64.4 percent of original size [2021-07-14 00:19:53,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-14 00:19:53,469 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-07-14 00:19:53,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-07-14 00:19:53,497 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:19:53,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:19:53,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:53,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:53,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,533 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-14 00:19:53,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:53,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899040007] [2021-07-14 00:19:53,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899040007] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:53,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:53,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-14 00:19:53,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673220284] [2021-07-14 00:19:53,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-14 00:19:53,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-14 00:19:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-14 00:19:53,535 INFO L87 Difference]: Start difference. First operand 438 states and 791 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:53,816 INFO L93 Difference]: Finished difference Result 592 states and 1117 transitions. [2021-07-14 00:19:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 00:19:53,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-07-14 00:19:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:53,827 INFO L225 Difference]: With dead ends: 592 [2021-07-14 00:19:53,827 INFO L226 Difference]: Without dead ends: 418 [2021-07-14 00:19:53,827 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 200.3ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-07-14 00:19:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-07-14 00:19:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 401. [2021-07-14 00:19:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 395 states have (on average 1.8025316455696203) internal successors, (712), 400 states have internal predecessors, (712), 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-14 00:19:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 712 transitions. [2021-07-14 00:19:53,848 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 712 transitions. Word has length 61 [2021-07-14 00:19:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:53,848 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 712 transitions. [2021-07-14 00:19:53,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 712 transitions. [2021-07-14 00:19:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-14 00:19:53,857 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:53,857 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-14 00:19:53,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-14 00:19:53,857 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1705577155, now seen corresponding path program 1 times [2021-07-14 00:19:53,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:53,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726231900] [2021-07-14 00:19:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:53,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:53,934 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:19:53,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:19:53,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:53,956 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:19:53,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:53,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:53,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:53,965 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-14 00:19:53,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:53,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726231900] [2021-07-14 00:19:53,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726231900] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:53,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:53,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:19:53,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671982501] [2021-07-14 00:19:53,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:19:53,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:19:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:19:53,967 INFO L87 Difference]: Start difference. First operand 401 states and 712 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-14 00:19:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:54,053 INFO L93 Difference]: Finished difference Result 389 states and 636 transitions. [2021-07-14 00:19:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:19:54,054 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-14 00:19:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:54,055 INFO L225 Difference]: With dead ends: 389 [2021-07-14 00:19:54,055 INFO L226 Difference]: Without dead ends: 265 [2021-07-14 00:19:54,056 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:19:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-07-14 00:19:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-07-14 00:19:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 259 states have (on average 1.7374517374517375) internal successors, (450), 264 states have internal predecessors, (450), 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-14 00:19:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 450 transitions. [2021-07-14 00:19:54,062 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 450 transitions. Word has length 62 [2021-07-14 00:19:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:54,062 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 450 transitions. [2021-07-14 00:19:54,063 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-14 00:19:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 450 transitions. [2021-07-14 00:19:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-14 00:19:54,065 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:54,065 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-14 00:19:54,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-14 00:19:54,066 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1508186311, now seen corresponding path program 1 times [2021-07-14 00:19:54,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:54,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361422767] [2021-07-14 00:19:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:19:54,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:54,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:54,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:54,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:54,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:54,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:19:54,143 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:19:54,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:19:54,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:54,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:19:54,167 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:19:54,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:19:54,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:19:54,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:19:54,178 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-14 00:19:54,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:19:54,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361422767] [2021-07-14 00:19:54,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361422767] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:19:54,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:19:54,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:19:54,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152193860] [2021-07-14 00:19:54,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:19:54,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:19:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:19:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:19:54,181 INFO L87 Difference]: Start difference. First operand 265 states and 450 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:19:54,289 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2021-07-14 00:19:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:19:54,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-07-14 00:19:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:19:54,291 INFO L225 Difference]: With dead ends: 173 [2021-07-14 00:19:54,291 INFO L226 Difference]: Without dead ends: 107 [2021-07-14 00:19:54,292 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:19:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-07-14 00:19:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-07-14 00:19:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 105 states have internal predecessors, (134), 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-14 00:19:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-07-14 00:19:54,295 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 63 [2021-07-14 00:19:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:19:54,295 INFO L482 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-07-14 00:19:54,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:19:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-07-14 00:19:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-14 00:19:54,296 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:19:54,296 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-14 00:19:54,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-14 00:19:54,297 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:19:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:19:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1217827190, now seen corresponding path program 1 times [2021-07-14 00:19:54,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:19:54,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013098519] [2021-07-14 00:19:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:19:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:19:54,351 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:19:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:19:54,400 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:19:54,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 00:19:54,428 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 00:19:54,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-14 00:19:54,428 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-14 00:19:54,430 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 00:19:54,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:19:54 BasicIcfg [2021-07-14 00:19:54,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 00:19:54,495 INFO L168 Benchmark]: Toolchain (without parser) took 7675.86 ms. Allocated memory was 187.7 MB in the beginning and 343.9 MB in the end (delta: 156.2 MB). Free memory was 151.6 MB in the beginning and 147.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 160.6 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,495 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 187.7 MB. Free memory is still 169.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 00:19:54,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.23 ms. Allocated memory is still 187.7 MB. Free memory was 151.3 MB in the beginning and 160.9 MB in the end (delta: -9.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.77 ms. Allocated memory is still 187.7 MB. Free memory was 160.9 MB in the beginning and 158.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,496 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 187.7 MB. Free memory was 158.0 MB in the beginning and 155.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,496 INFO L168 Benchmark]: RCFGBuilder took 1508.99 ms. Allocated memory was 187.7 MB in the beginning and 248.5 MB in the end (delta: 60.8 MB). Free memory was 155.9 MB in the beginning and 176.8 MB in the end (delta: -21.0 MB). Peak memory consumption was 96.7 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,496 INFO L168 Benchmark]: TraceAbstraction took 5501.16 ms. Allocated memory was 248.5 MB in the beginning and 343.9 MB in the end (delta: 95.4 MB). Free memory was 176.3 MB in the beginning and 147.6 MB in the end (delta: 28.7 MB). Peak memory consumption was 124.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:19:54,497 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.53 ms. Allocated memory is still 187.7 MB. Free memory is still 169.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 564.23 ms. Allocated memory is still 187.7 MB. Free memory was 151.3 MB in the beginning and 160.9 MB in the end (delta: -9.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.77 ms. Allocated memory is still 187.7 MB. Free memory was 160.9 MB in the beginning and 158.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 187.7 MB. Free memory was 158.0 MB in the beginning and 155.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1508.99 ms. Allocated memory was 187.7 MB in the beginning and 248.5 MB in the end (delta: 60.8 MB). Free memory was 155.9 MB in the beginning and 176.8 MB in the end (delta: -21.0 MB). Peak memory consumption was 96.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5501.16 ms. Allocated memory was 248.5 MB in the beginning and 343.9 MB in the end (delta: 95.4 MB). Free memory was 176.3 MB in the beginning and 147.6 MB in the end (delta: 28.7 MB). Peak memory consumption was 124.2 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: 146, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 146, negative conditional: 0, negative unconditional: 146, 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: 2687, positive: 2365, positive conditional: 2365, positive unconditional: 0, negative: 322, negative conditional: 322, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2545, positive: 2365, positive conditional: 0, positive unconditional: 2365, negative: 180, negative conditional: 0, negative unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 417, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 417, positive: 391, positive conditional: 0, positive unconditional: 391, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 304, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 302, negative conditional: 0, negative unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2545, positive: 1973, positive conditional: 0, positive unconditional: 1973, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 417, unknown conditional: 0, unknown unconditional: 417] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 392, Positive conditional cache size: 0, Positive unconditional cache size: 392, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 142 - 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] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L790] 0 pthread_t t2479; VAL [__unbuffered_cnt=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] [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L792] 0 pthread_t t2480; VAL [__unbuffered_cnt=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] [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L740] 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) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] 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) [L740] 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) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 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 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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, 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] [L799] 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) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 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 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 706.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 10.5ms, AutomataDifference: 78.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 299.5ms, PartialOrderReductionTime: 270.9ms, HoareTripleCheckerStatistics: 70 SDtfs, 27 SDslu, 22 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred 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: 7.9ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.6ms SsaConstructionTime, 41.8ms SatisfiabilityAnalysisTime, 168.6ms InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 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, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4614.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 31.9ms, AutomataDifference: 2112.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 385.9ms, PartialOrderReductionTime: 384.5ms, HoareTripleCheckerStatistics: 918 SDtfs, 1136 SDslu, 3399 SDs, 0 SdLazy, 671 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 774.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1604.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1243occurred in iteration=0, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 156.2ms AutomataMinimizationTime, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.9ms SsaConstructionTime, 449.3ms SatisfiabilityAnalysisTime, 1268.5ms InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...