/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 01:04:45,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 01:04:45,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 01:04:45,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 01:04:45,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 01:04:45,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 01:04:45,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 01:04:45,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 01:04:45,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 01:04:45,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 01:04:45,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 01:04:45,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 01:04:45,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 01:04:45,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 01:04:45,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 01:04:45,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 01:04:45,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 01:04:45,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 01:04:45,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 01:04:45,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 01:04:45,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 01:04:45,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 01:04:45,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 01:04:45,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 01:04:45,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 01:04:45,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 01:04:45,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 01:04:45,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 01:04:45,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 01:04:45,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 01:04:45,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 01:04:45,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 01:04:45,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 01:04:45,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 01:04:45,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 01:04:45,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 01:04:45,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 01:04:45,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 01:04:45,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 01:04:45,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 01:04:45,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 01:04:45,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-04-15 01:04:45,505 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 01:04:45,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 01:04:45,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 01:04:45,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 01:04:45,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 01:04:45,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 01:04:45,509 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 01:04:45,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 01:04:45,509 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 01:04:45,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 01:04:45,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 01:04:45,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 01:04:45,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 01:04:45,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 01:04:45,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 01:04:45,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 01:04:45,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 01:04:45,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 01:04:45,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 01:04:45,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 01:04:45,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 01:04:45,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 01:04:45,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 01:04:45,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 01:04:45,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 01:04:45,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 01:04:45,513 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-04-15 01:04:45,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 01:04:45,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 01:04:45,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 01:04:45,847 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 01:04:45,848 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 01:04:45,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-04-15 01:04:45,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35f955f/1733a04105ec49dcaf9083f76215caf6/FLAGbbb423637 [2021-04-15 01:04:46,315 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 01:04:46,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-04-15 01:04:46,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35f955f/1733a04105ec49dcaf9083f76215caf6/FLAGbbb423637 [2021-04-15 01:04:46,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35f955f/1733a04105ec49dcaf9083f76215caf6 [2021-04-15 01:04:46,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 01:04:46,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 01:04:46,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:46,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 01:04:46,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 01:04:46,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:46,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469e1e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46, skipping insertion in model container [2021-04-15 01:04:46,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:46,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 01:04:46,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 01:04:46,563 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-04-15 01:04:46,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:04:46,803 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 01:04:46,815 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-04-15 01:04:46,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:04:46,939 INFO L208 MainTranslator]: Completed translation [2021-04-15 01:04:46,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46 WrapperNode [2021-04-15 01:04:46,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:46,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 01:04:46,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 01:04:46,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 01:04:46,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:46,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 01:04:47,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 01:04:47,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 01:04:47,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 01:04:47,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (1/1) ... [2021-04-15 01:04:47,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 01:04:47,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 01:04:47,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 01:04:47,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 01:04:47,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (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-04-15 01:04:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 01:04:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 01:04:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 01:04:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 01:04:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 01:04:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 01:04:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 01:04:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 01:04:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 01:04:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 01:04:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 01:04:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 01:04:47,125 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 01:04:48,773 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 01:04:48,773 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 01:04:48,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:48 BoogieIcfgContainer [2021-04-15 01:04:48,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 01:04:48,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 01:04:48,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 01:04:48,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 01:04:48,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:46" (1/3) ... [2021-04-15 01:04:48,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783ee27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:48, skipping insertion in model container [2021-04-15 01:04:48,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:46" (2/3) ... [2021-04-15 01:04:48,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783ee27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:48, skipping insertion in model container [2021-04-15 01:04:48,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:48" (3/3) ... [2021-04-15 01:04:48,782 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-04-15 01:04:48,790 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 01:04:48,790 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 01:04:48,793 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 01:04:48,794 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 01:04:48,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,822 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,822 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,828 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,828 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:04:48,838 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 01:04:48,852 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-04-15 01:04:48,874 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 01:04:48,874 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 01:04:48,874 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 01:04:48,875 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 01:04:48,875 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 01:04:48,875 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 01:04:48,875 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 01:04:48,875 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 01:04:48,885 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 79 transitions, 168 flow [2021-04-15 01:04:48,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1797 states, 1793 states have (on average 2.7601784718349136) internal successors, (4949), 1796 states have internal predecessors, (4949), 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-04-15 01:04:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 1797 states, 1793 states have (on average 2.7601784718349136) internal successors, (4949), 1796 states have internal predecessors, (4949), 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-04-15 01:04:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-04-15 01:04:48,974 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:48,974 INFO L551 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] [2021-04-15 01:04:48,975 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 253733698, now seen corresponding path program 1 times [2021-04-15 01:04:48,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:48,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838841171] [2021-04-15 01:04:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:49,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838841171] [2021-04-15 01:04:49,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:49,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 01:04:49,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633474989] [2021-04-15 01:04:49,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 01:04:49,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:49,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 01:04:49,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:04:49,241 INFO L87 Difference]: Start difference. First operand has 1797 states, 1793 states have (on average 2.7601784718349136) internal successors, (4949), 1796 states have internal predecessors, (4949), 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 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-04-15 01:04:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:49,322 INFO L93 Difference]: Finished difference Result 1537 states and 4077 transitions. [2021-04-15 01:04:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 01:04:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-04-15 01:04:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:49,344 INFO L225 Difference]: With dead ends: 1537 [2021-04-15 01:04:49,344 INFO L226 Difference]: Without dead ends: 961 [2021-04-15 01:04:49,345 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:04:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-04-15 01:04:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2021-04-15 01:04:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 2.596875) internal successors, (2493), 960 states have internal predecessors, (2493), 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-04-15 01:04:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2493 transitions. [2021-04-15 01:04:49,433 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 2493 transitions. Word has length 35 [2021-04-15 01:04:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:49,433 INFO L480 AbstractCegarLoop]: Abstraction has 961 states and 2493 transitions. [2021-04-15 01:04:49,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-04-15 01:04:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 2493 transitions. [2021-04-15 01:04:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-04-15 01:04:49,442 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:49,442 INFO L551 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] [2021-04-15 01:04:49,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 01:04:49,443 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2045888562, now seen corresponding path program 1 times [2021-04-15 01:04:49,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:49,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124935123] [2021-04-15 01:04:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:49,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124935123] [2021-04-15 01:04:49,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:49,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:04:49,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026723572] [2021-04-15 01:04:49,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:04:49,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:04:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:04:49,712 INFO L87 Difference]: Start difference. First operand 961 states and 2493 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-04-15 01:04:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:49,830 INFO L93 Difference]: Finished difference Result 1181 states and 3031 transitions. [2021-04-15 01:04:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:04:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 50 [2021-04-15 01:04:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:49,834 INFO L225 Difference]: With dead ends: 1181 [2021-04-15 01:04:49,834 INFO L226 Difference]: Without dead ends: 925 [2021-04-15 01:04:49,836 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:04:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-04-15 01:04:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2021-04-15 01:04:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 2.581168831168831) internal successors, (2385), 924 states have internal predecessors, (2385), 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-04-15 01:04:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 2385 transitions. [2021-04-15 01:04:49,859 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 2385 transitions. Word has length 50 [2021-04-15 01:04:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:49,861 INFO L480 AbstractCegarLoop]: Abstraction has 925 states and 2385 transitions. [2021-04-15 01:04:49,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-04-15 01:04:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 2385 transitions. [2021-04-15 01:04:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-04-15 01:04:49,864 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:49,864 INFO L551 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] [2021-04-15 01:04:49,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 01:04:49,865 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash -46907021, now seen corresponding path program 1 times [2021-04-15 01:04:49,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:49,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322862964] [2021-04-15 01:04:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:50,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322862964] [2021-04-15 01:04:50,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:50,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:04:50,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094724556] [2021-04-15 01:04:50,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:04:50,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:04:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:04:50,145 INFO L87 Difference]: Start difference. First operand 925 states and 2385 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-04-15 01:04:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:50,474 INFO L93 Difference]: Finished difference Result 1111 states and 2839 transitions. [2021-04-15 01:04:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:04:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 52 [2021-04-15 01:04:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:50,480 INFO L225 Difference]: With dead ends: 1111 [2021-04-15 01:04:50,480 INFO L226 Difference]: Without dead ends: 919 [2021-04-15 01:04:50,481 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 212.4ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:04:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-04-15 01:04:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 913. [2021-04-15 01:04:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 2.575657894736842) internal successors, (2349), 912 states have internal predecessors, (2349), 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-04-15 01:04:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2349 transitions. [2021-04-15 01:04:50,505 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 2349 transitions. Word has length 52 [2021-04-15 01:04:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:50,507 INFO L480 AbstractCegarLoop]: Abstraction has 913 states and 2349 transitions. [2021-04-15 01:04:50,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-04-15 01:04:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 2349 transitions. [2021-04-15 01:04:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-15 01:04:50,509 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:50,509 INFO L551 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] [2021-04-15 01:04:50,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 01:04:50,510 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -823360013, now seen corresponding path program 1 times [2021-04-15 01:04:50,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:50,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534027783] [2021-04-15 01:04:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:50,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534027783] [2021-04-15 01:04:50,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:50,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:04:50,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810482489] [2021-04-15 01:04:50,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:04:50,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:04:50,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:04:50,676 INFO L87 Difference]: Start difference. First operand 913 states and 2349 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-04-15 01:04:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:50,796 INFO L93 Difference]: Finished difference Result 1553 states and 3941 transitions. [2021-04-15 01:04:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:04:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2021-04-15 01:04:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:50,806 INFO L225 Difference]: With dead ends: 1553 [2021-04-15 01:04:50,806 INFO L226 Difference]: Without dead ends: 1033 [2021-04-15 01:04:50,807 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:04:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-04-15 01:04:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 853. [2021-04-15 01:04:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 2.5035211267605635) internal successors, (2133), 852 states have internal predecessors, (2133), 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-04-15 01:04:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2133 transitions. [2021-04-15 01:04:50,828 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2133 transitions. Word has length 53 [2021-04-15 01:04:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:50,829 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 2133 transitions. [2021-04-15 01:04:50,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-04-15 01:04:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2133 transitions. [2021-04-15 01:04:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-15 01:04:50,831 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:50,831 INFO L551 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] [2021-04-15 01:04:50,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 01:04:50,832 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656663, now seen corresponding path program 1 times [2021-04-15 01:04:50,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:50,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268839747] [2021-04-15 01:04:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:51,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268839747] [2021-04-15 01:04:51,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:51,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:04:51,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874519328] [2021-04-15 01:04:51,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:04:51,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:51,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:04:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:04:51,039 INFO L87 Difference]: Start difference. First operand 853 states and 2133 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-04-15 01:04:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:51,365 INFO L93 Difference]: Finished difference Result 1001 states and 2487 transitions. [2021-04-15 01:04:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:04:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 53 [2021-04-15 01:04:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:51,376 INFO L225 Difference]: With dead ends: 1001 [2021-04-15 01:04:51,377 INFO L226 Difference]: Without dead ends: 841 [2021-04-15 01:04:51,377 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 228.0ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:04:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-04-15 01:04:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2021-04-15 01:04:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 2.4964285714285714) internal successors, (2097), 840 states have internal predecessors, (2097), 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-04-15 01:04:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2097 transitions. [2021-04-15 01:04:51,398 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2097 transitions. Word has length 53 [2021-04-15 01:04:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:51,398 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 2097 transitions. [2021-04-15 01:04:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-04-15 01:04:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2097 transitions. [2021-04-15 01:04:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-15 01:04:51,400 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:51,401 INFO L551 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] [2021-04-15 01:04:51,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 01:04:51,401 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1099500299, now seen corresponding path program 1 times [2021-04-15 01:04:51,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:51,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562111357] [2021-04-15 01:04:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:51,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562111357] [2021-04-15 01:04:51,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:51,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:04:51,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106677009] [2021-04-15 01:04:51,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:04:51,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:51,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:04:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:04:51,638 INFO L87 Difference]: Start difference. First operand 841 states and 2097 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-04-15 01:04:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:52,296 INFO L93 Difference]: Finished difference Result 1000 states and 2477 transitions. [2021-04-15 01:04:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-04-15 01:04:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 54 [2021-04-15 01:04:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:52,301 INFO L225 Difference]: With dead ends: 1000 [2021-04-15 01:04:52,301 INFO L226 Difference]: Without dead ends: 856 [2021-04-15 01:04:52,303 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 436.6ms TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-04-15 01:04:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-04-15 01:04:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2021-04-15 01:04:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 2.4853801169590644) internal successors, (2125), 855 states have internal predecessors, (2125), 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-04-15 01:04:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2125 transitions. [2021-04-15 01:04:52,332 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2125 transitions. Word has length 54 [2021-04-15 01:04:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:52,333 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 2125 transitions. [2021-04-15 01:04:52,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-04-15 01:04:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2125 transitions. [2021-04-15 01:04:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-15 01:04:52,334 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:52,334 INFO L551 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] [2021-04-15 01:04:52,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 01:04:52,335 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1275940729, now seen corresponding path program 2 times [2021-04-15 01:04:52,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:52,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218444575] [2021-04-15 01:04:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:52,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218444575] [2021-04-15 01:04:52,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:52,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:04:52,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601936340] [2021-04-15 01:04:52,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:04:52,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:52,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:04:52,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:04:52,558 INFO L87 Difference]: Start difference. First operand 856 states and 2125 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-04-15 01:04:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:52,733 INFO L93 Difference]: Finished difference Result 988 states and 2439 transitions. [2021-04-15 01:04:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:04:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 54 [2021-04-15 01:04:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:52,737 INFO L225 Difference]: With dead ends: 988 [2021-04-15 01:04:52,737 INFO L226 Difference]: Without dead ends: 844 [2021-04-15 01:04:52,738 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 171.2ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:04:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-04-15 01:04:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2021-04-15 01:04:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 2.4780545670225385) internal successors, (2089), 843 states have internal predecessors, (2089), 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-04-15 01:04:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2089 transitions. [2021-04-15 01:04:52,759 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2089 transitions. Word has length 54 [2021-04-15 01:04:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:52,759 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 2089 transitions. [2021-04-15 01:04:52,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-04-15 01:04:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2089 transitions. [2021-04-15 01:04:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-15 01:04:52,762 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:52,762 INFO L551 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] [2021-04-15 01:04:52,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 01:04:52,762 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1518276276, now seen corresponding path program 1 times [2021-04-15 01:04:52,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:52,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923330099] [2021-04-15 01:04:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:52,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923330099] [2021-04-15 01:04:52,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:52,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 01:04:52,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901863398] [2021-04-15 01:04:52,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 01:04:52,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 01:04:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:04:52,985 INFO L87 Difference]: Start difference. First operand 844 states and 2089 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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-04-15 01:04:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:53,247 INFO L93 Difference]: Finished difference Result 924 states and 2269 transitions. [2021-04-15 01:04:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:04:53,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 54 [2021-04-15 01:04:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:53,251 INFO L225 Difference]: With dead ends: 924 [2021-04-15 01:04:53,251 INFO L226 Difference]: Without dead ends: 796 [2021-04-15 01:04:53,252 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 240.2ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:04:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-04-15 01:04:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2021-04-15 01:04:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.4616352201257863) internal successors, (1957), 795 states have internal predecessors, (1957), 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-04-15 01:04:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1957 transitions. [2021-04-15 01:04:53,273 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1957 transitions. Word has length 54 [2021-04-15 01:04:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:53,273 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 1957 transitions. [2021-04-15 01:04:53,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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-04-15 01:04:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1957 transitions. [2021-04-15 01:04:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-04-15 01:04:53,275 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:53,275 INFO L551 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] [2021-04-15 01:04:53,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 01:04:53,275 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:53,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1695194197, now seen corresponding path program 1 times [2021-04-15 01:04:53,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:53,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825907950] [2021-04-15 01:04:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:53,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825907950] [2021-04-15 01:04:53,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:53,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:04:53,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139660455] [2021-04-15 01:04:53,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:04:53,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:53,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:04:53,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:04:53,434 INFO L87 Difference]: Start difference. First operand 796 states and 1957 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-04-15 01:04:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:53,716 INFO L93 Difference]: Finished difference Result 919 states and 2249 transitions. [2021-04-15 01:04:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:04:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 55 [2021-04-15 01:04:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:53,720 INFO L225 Difference]: With dead ends: 919 [2021-04-15 01:04:53,720 INFO L226 Difference]: Without dead ends: 799 [2021-04-15 01:04:53,720 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 173.5ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:04:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-04-15 01:04:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 791. [2021-04-15 01:04:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 2.4645569620253163) internal successors, (1947), 790 states have internal predecessors, (1947), 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-04-15 01:04:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1947 transitions. [2021-04-15 01:04:53,737 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1947 transitions. Word has length 55 [2021-04-15 01:04:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:53,737 INFO L480 AbstractCegarLoop]: Abstraction has 791 states and 1947 transitions. [2021-04-15 01:04:53,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-04-15 01:04:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1947 transitions. [2021-04-15 01:04:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-04-15 01:04:53,738 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:53,739 INFO L551 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] [2021-04-15 01:04:53,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 01:04:53,739 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 899106833, now seen corresponding path program 2 times [2021-04-15 01:04:53,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:53,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353378984] [2021-04-15 01:04:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:53,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353378984] [2021-04-15 01:04:53,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:53,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:04:53,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296823415] [2021-04-15 01:04:53,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:04:53,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:04:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:04:53,919 INFO L87 Difference]: Start difference. First operand 791 states and 1947 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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-04-15 01:04:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:54,109 INFO L93 Difference]: Finished difference Result 952 states and 2306 transitions. [2021-04-15 01:04:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:04:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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 55 [2021-04-15 01:04:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:54,113 INFO L225 Difference]: With dead ends: 952 [2021-04-15 01:04:54,113 INFO L226 Difference]: Without dead ends: 820 [2021-04-15 01:04:54,113 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 167.8ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:04:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-04-15 01:04:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 781. [2021-04-15 01:04:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 2.4602564102564104) internal successors, (1919), 780 states have internal predecessors, (1919), 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-04-15 01:04:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1919 transitions. [2021-04-15 01:04:54,130 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1919 transitions. Word has length 55 [2021-04-15 01:04:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:54,130 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1919 transitions. [2021-04-15 01:04:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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-04-15 01:04:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1919 transitions. [2021-04-15 01:04:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-04-15 01:04:54,131 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:54,132 INFO L551 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] [2021-04-15 01:04:54,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 01:04:54,132 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2022343301, now seen corresponding path program 3 times [2021-04-15 01:04:54,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:54,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183553415] [2021-04-15 01:04:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:54,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183553415] [2021-04-15 01:04:54,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:54,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:04:54,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525056386] [2021-04-15 01:04:54,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:04:54,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:04:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:04:54,333 INFO L87 Difference]: Start difference. First operand 781 states and 1919 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-04-15 01:04:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:54,807 INFO L93 Difference]: Finished difference Result 1025 states and 2497 transitions. [2021-04-15 01:04:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:04:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 55 [2021-04-15 01:04:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:54,811 INFO L225 Difference]: With dead ends: 1025 [2021-04-15 01:04:54,811 INFO L226 Difference]: Without dead ends: 769 [2021-04-15 01:04:54,812 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 376.7ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-04-15 01:04:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2021-04-15 01:04:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 737. [2021-04-15 01:04:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 2.436141304347826) internal successors, (1793), 736 states have internal predecessors, (1793), 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-04-15 01:04:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1793 transitions. [2021-04-15 01:04:54,834 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1793 transitions. Word has length 55 [2021-04-15 01:04:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:54,834 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1793 transitions. [2021-04-15 01:04:54,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-04-15 01:04:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1793 transitions. [2021-04-15 01:04:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-15 01:04:54,839 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:54,839 INFO L551 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-04-15 01:04:54,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 01:04:54,839 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1944775018, now seen corresponding path program 1 times [2021-04-15 01:04:54,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:54,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176329631] [2021-04-15 01:04:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:54,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-04-15 01:04:54,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176329631] [2021-04-15 01:04:54,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:54,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:04:54,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360995311] [2021-04-15 01:04:54,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:04:54,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:04:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:04:54,933 INFO L87 Difference]: Start difference. First operand 737 states and 1793 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:04:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:55,015 INFO L93 Difference]: Finished difference Result 803 states and 1893 transitions. [2021-04-15 01:04:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:04:55,015 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-04-15 01:04:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:55,017 INFO L225 Difference]: With dead ends: 803 [2021-04-15 01:04:55,017 INFO L226 Difference]: Without dead ends: 563 [2021-04-15 01:04:55,018 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:04:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-04-15 01:04:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2021-04-15 01:04:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 2.314946619217082) internal successors, (1301), 562 states have internal predecessors, (1301), 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-04-15 01:04:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1301 transitions. [2021-04-15 01:04:55,028 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1301 transitions. Word has length 56 [2021-04-15 01:04:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:55,029 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 1301 transitions. [2021-04-15 01:04:55,029 INFO L481 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-04-15 01:04:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1301 transitions. [2021-04-15 01:04:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-15 01:04:55,033 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:55,033 INFO L551 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] [2021-04-15 01:04:55,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 01:04:55,033 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2146527477, now seen corresponding path program 1 times [2021-04-15 01:04:55,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:55,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427220327] [2021-04-15 01:04:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:55,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427220327] [2021-04-15 01:04:55,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:55,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 01:04:55,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917591623] [2021-04-15 01:04:55,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 01:04:55,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 01:04:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 01:04:55,140 INFO L87 Difference]: Start difference. First operand 563 states and 1301 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-15 01:04:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:55,236 INFO L93 Difference]: Finished difference Result 437 states and 950 transitions. [2021-04-15 01:04:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 01:04:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 57 [2021-04-15 01:04:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:55,238 INFO L225 Difference]: With dead ends: 437 [2021-04-15 01:04:55,238 INFO L226 Difference]: Without dead ends: 273 [2021-04-15 01:04:55,239 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:04:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-04-15 01:04:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2021-04-15 01:04:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.0568181818181817) internal successors, (543), 264 states have internal predecessors, (543), 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-04-15 01:04:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 543 transitions. [2021-04-15 01:04:55,244 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 543 transitions. Word has length 57 [2021-04-15 01:04:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:55,244 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 543 transitions. [2021-04-15 01:04:55,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-15 01:04:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 543 transitions. [2021-04-15 01:04:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 01:04:55,245 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:55,245 INFO L551 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-04-15 01:04:55,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 01:04:55,245 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash -69732152, now seen corresponding path program 1 times [2021-04-15 01:04:55,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:55,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802422723] [2021-04-15 01:04:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:04:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:04:55,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802422723] [2021-04-15 01:04:55,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:04:55,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 01:04:55,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780406501] [2021-04-15 01:04:55,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 01:04:55,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:04:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 01:04:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:04:55,489 INFO L87 Difference]: Start difference. First operand 265 states and 543 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-04-15 01:04:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:04:55,646 INFO L93 Difference]: Finished difference Result 395 states and 835 transitions. [2021-04-15 01:04:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:04:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-04-15 01:04:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:04:55,648 INFO L225 Difference]: With dead ends: 395 [2021-04-15 01:04:55,648 INFO L226 Difference]: Without dead ends: 225 [2021-04-15 01:04:55,649 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 204.1ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:04:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-04-15 01:04:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-04-15 01:04:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.013392857142857) internal successors, (451), 224 states have internal predecessors, (451), 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-04-15 01:04:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 451 transitions. [2021-04-15 01:04:55,653 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 451 transitions. Word has length 60 [2021-04-15 01:04:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:04:55,653 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 451 transitions. [2021-04-15 01:04:55,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 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-04-15 01:04:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 451 transitions. [2021-04-15 01:04:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 01:04:55,654 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:04:55,654 INFO L551 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-04-15 01:04:55,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 01:04:55,654 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:04:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:04:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -437888662, now seen corresponding path program 2 times [2021-04-15 01:04:55,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:04:55,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80761506] [2021-04-15 01:04:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:04:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:04:55,686 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:04:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:04:55,716 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:04:55,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 01:04:55,753 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 01:04:55,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 01:04:55,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:04:55 BasicIcfg [2021-04-15 01:04:55,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 01:04:55,854 INFO L168 Benchmark]: Toolchain (without parser) took 9509.99 ms. Allocated memory was 383.8 MB in the beginning and 522.2 MB in the end (delta: 138.4 MB). Free memory was 346.7 MB in the beginning and 339.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 147.2 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,854 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 383.8 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 01:04:55,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.36 ms. Allocated memory is still 383.8 MB. Free memory was 346.4 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.24 ms. Allocated memory is still 383.8 MB. Free memory was 343.8 MB in the beginning and 341.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,854 INFO L168 Benchmark]: Boogie Preprocessor took 34.64 ms. Allocated memory is still 383.8 MB. Free memory was 341.7 MB in the beginning and 339.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,854 INFO L168 Benchmark]: RCFGBuilder took 1725.57 ms. Allocated memory is still 383.8 MB. Free memory was 339.6 MB in the beginning and 320.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,855 INFO L168 Benchmark]: TraceAbstraction took 7076.38 ms. Allocated memory was 383.8 MB in the beginning and 522.2 MB in the end (delta: 138.4 MB). Free memory was 320.9 MB in the beginning and 339.1 MB in the end (delta: -18.1 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.0 GB. [2021-04-15 01:04:55,855 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.15 ms. Allocated memory is still 383.8 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 595.36 ms. Allocated memory is still 383.8 MB. Free memory was 346.4 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 73.24 ms. Allocated memory is still 383.8 MB. Free memory was 343.8 MB in the beginning and 341.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.64 ms. Allocated memory is still 383.8 MB. Free memory was 341.7 MB in the beginning and 339.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1725.57 ms. Allocated memory is still 383.8 MB. Free memory was 339.6 MB in the beginning and 320.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7076.38 ms. Allocated memory was 383.8 MB in the beginning and 522.2 MB in the end (delta: 138.4 MB). Free memory was 320.9 MB in the beginning and 339.1 MB in the end (delta: -18.1 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6881.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 43.2ms, AutomataDifference: 3471.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 88.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1266 SDtfs, 2115 SDslu, 5110 SDs, 0 SdLazy, 1096 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1221.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2585.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1797occurred in iteration=0, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 308.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 273 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 57.0ms SsaConstructionTime, 537.1ms SatisfiabilityAnalysisTime, 2080.8ms InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 4610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...