/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:51:45,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:51:45,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:51:45,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:51:45,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:51:45,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:51:45,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:51:45,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:51:45,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:51:45,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:51:45,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:51:45,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:51:45,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:51:45,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:51:45,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:51:45,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:51:45,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:51:45,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:51:45,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:51:45,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:51:45,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:51:45,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:51:45,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:51:45,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:51:45,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:51:45,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:51:45,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:51:45,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:51:45,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:51:45,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:51:45,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:51:45,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:51:45,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:51:45,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:51:45,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:51:45,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:51:45,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:51:45,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:51:45,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:51:45,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:51:45,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:51:45,133 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-07-09 16:51:45,162 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:51:45,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:51:45,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:51:45,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:51:45,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:51:45,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:51:45,165 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:51:45,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:51:45,166 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:51:45,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:51:45,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:51:45,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:51:45,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:51:45,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:51:45,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:51:45,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:51:45,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:51:45,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-09 16:51:45,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:51:45,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:51:45,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:51:45,423 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:51:45,424 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:51:45,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2021-07-09 16:51:45,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06a17aee/b1e5ec494bcc4cb4a29620c0338cca35/FLAG78c061502 [2021-07-09 16:51:45,826 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:51:45,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2021-07-09 16:51:45,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06a17aee/b1e5ec494bcc4cb4a29620c0338cca35/FLAG78c061502 [2021-07-09 16:51:46,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e06a17aee/b1e5ec494bcc4cb4a29620c0338cca35 [2021-07-09 16:51:46,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:51:46,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:51:46,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:46,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:51:46,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:51:46,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c43fa7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46, skipping insertion in model container [2021-07-09 16:51:46,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:51:46,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:51:46,361 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i[949,962] [2021-07-09 16:51:46,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:46,559 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:51:46,568 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i[949,962] [2021-07-09 16:51:46,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:46,661 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:51:46,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46 WrapperNode [2021-07-09 16:51:46,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:46,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:46,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:51:46,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:51:46,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:46,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:51:46,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:51:46,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:51:46,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (1/1) ... [2021-07-09 16:51:46,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:51:46,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:51:46,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:51:46,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:51:46,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51: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-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:51:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:51:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:51:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:51:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:51:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:51:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:51:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:51:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:51:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:51:46,819 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:51:48,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:51:48,133 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:51:48,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:48 BoogieIcfgContainer [2021-07-09 16:51:48,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:51:48,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:51:48,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:51:48,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:51:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:51:46" (1/3) ... [2021-07-09 16:51:48,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6267021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:48, skipping insertion in model container [2021-07-09 16:51:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:46" (2/3) ... [2021-07-09 16:51:48,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6267021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:48, skipping insertion in model container [2021-07-09 16:51:48,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:48" (3/3) ... [2021-07-09 16:51:48,142 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2021-07-09 16:51:48,147 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:51:48,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:51:48,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:51:48,147 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,183 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,183 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:48,202 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:51:48,219 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:51:48,231 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:51:48,232 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:51:48,232 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:51:48,232 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:51:48,232 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:51:48,232 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:51:48,232 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:51:48,232 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-09 16:51:48,239 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-07-09 16:51:48,362 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-09 16:51:48,399 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,400 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:48,400 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1699461236, now seen corresponding path program 1 times [2021-07-09 16:51:48,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051510864] [2021-07-09 16:51:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:48,639 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:48,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051510864] [2021-07-09 16:51:48,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051510864] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:48,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:48,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 16:51:48,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980559059] [2021-07-09 16:51:48,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:51:48,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:51:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:51:48,666 INFO L87 Difference]: Start difference. First operand has 5015 states, 5013 states have (on average 3.348294434470377) internal successors, (16785), 5014 states have internal predecessors, (16785), 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 27.0) internal successors, (54), 3 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-07-09 16:51:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:48,723 INFO L93 Difference]: Finished difference Result 3391 states and 10500 transitions. [2021-07-09 16:51:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:51:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 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-07-09 16:51:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:48,729 INFO L225 Difference]: With dead ends: 3391 [2021-07-09 16:51:48,729 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:51:48,730 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:51:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:51:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:51:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:51:48,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-07-09 16:51:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,744 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:51:48,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 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-07-09 16:51:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:51:48,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:51:48,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:51:48,746 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 16:51:48,747 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:51:48,756 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:51:48,757 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:51:48,757 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:51:48,757 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:51:48,757 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:51:48,757 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:51:48,757 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:51:48,757 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:51:48,759 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-07-09 16:51:48,888 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-09 16:51:48,924 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,924 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:48,924 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1498850709, now seen corresponding path program 1 times [2021-07-09 16:51:48,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226543027] [2021-07-09 16:51:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:49,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:49,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226543027] [2021-07-09 16:51:49,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226543027] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:49,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:49,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:49,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861572270] [2021-07-09 16:51:49,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:49,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:49,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:49,196 INFO L87 Difference]: Start difference. First operand has 8543 states, 8541 states have (on average 3.5593021894391756) internal successors, (30400), 8542 states have internal predecessors, (30400), 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 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:49,527 INFO L93 Difference]: Finished difference Result 9929 states and 34367 transitions. [2021-07-09 16:51:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-09 16:51:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:49,584 INFO L225 Difference]: With dead ends: 9929 [2021-07-09 16:51:49,585 INFO L226 Difference]: Without dead ends: 7409 [2021-07-09 16:51:49,585 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 126.2ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-07-09 16:51:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2021-07-09 16:51:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 7409. [2021-07-09 16:51:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7409 states, 7407 states have (on average 3.4617253948967193) internal successors, (25641), 7408 states have internal predecessors, (25641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7409 states to 7409 states and 25641 transitions. [2021-07-09 16:51:49,968 INFO L78 Accepts]: Start accepts. Automaton has 7409 states and 25641 transitions. Word has length 66 [2021-07-09 16:51:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:49,969 INFO L482 AbstractCegarLoop]: Abstraction has 7409 states and 25641 transitions. [2021-07-09 16:51:49,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7409 states and 25641 transitions. [2021-07-09 16:51:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-09 16:51:49,982 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:49,982 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:49,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:51:49,982 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1518314184, now seen corresponding path program 1 times [2021-07-09 16:51:49,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:49,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520129596] [2021-07-09 16:51:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:50,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:50,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520129596] [2021-07-09 16:51:50,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520129596] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:50,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:50,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:50,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328071817] [2021-07-09 16:51:50,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:50,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:50,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:50,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:50,138 INFO L87 Difference]: Start difference. First operand 7409 states and 25641 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:50,387 INFO L93 Difference]: Finished difference Result 8429 states and 28922 transitions. [2021-07-09 16:51:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-07-09 16:51:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:50,473 INFO L225 Difference]: With dead ends: 8429 [2021-07-09 16:51:50,474 INFO L226 Difference]: Without dead ends: 7169 [2021-07-09 16:51:50,474 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2021-07-09 16:51:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2021-07-09 16:51:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7169 states, 7167 states have (on average 3.4503976559229805) internal successors, (24729), 7168 states have internal predecessors, (24729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 24729 transitions. [2021-07-09 16:51:50,672 INFO L78 Accepts]: Start accepts. Automaton has 7169 states and 24729 transitions. Word has length 69 [2021-07-09 16:51:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:50,672 INFO L482 AbstractCegarLoop]: Abstraction has 7169 states and 24729 transitions. [2021-07-09 16:51:50,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 24729 transitions. [2021-07-09 16:51:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 16:51:50,686 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:50,686 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:50,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:51:50,687 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1051979724, now seen corresponding path program 1 times [2021-07-09 16:51:50,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:50,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440422239] [2021-07-09 16:51:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:50,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:50,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440422239] [2021-07-09 16:51:50,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440422239] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:50,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:50,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:50,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843474575] [2021-07-09 16:51:50,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:50,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:50,910 INFO L87 Difference]: Start difference. First operand 7169 states and 24729 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:51,054 INFO L93 Difference]: Finished difference Result 11051 states and 37588 transitions. [2021-07-09 16:51:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-09 16:51:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:51,142 INFO L225 Difference]: With dead ends: 11051 [2021-07-09 16:51:51,142 INFO L226 Difference]: Without dead ends: 7475 [2021-07-09 16:51:51,142 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2021-07-09 16:51:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 6725. [2021-07-09 16:51:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6725 states, 6723 states have (on average 3.383757251227131) internal successors, (22749), 6724 states have internal predecessors, (22749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 22749 transitions. [2021-07-09 16:51:51,349 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 22749 transitions. Word has length 70 [2021-07-09 16:51:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:51,350 INFO L482 AbstractCegarLoop]: Abstraction has 6725 states and 22749 transitions. [2021-07-09 16:51:51,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 22749 transitions. [2021-07-09 16:51:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:51:51,362 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:51,362 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:51,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:51:51,363 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash -646375001, now seen corresponding path program 1 times [2021-07-09 16:51:51,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:51,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863577890] [2021-07-09 16:51:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:51,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:51,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863577890] [2021-07-09 16:51:51,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863577890] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:51,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:51,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:51,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776026463] [2021-07-09 16:51:51,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:51,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:51,561 INFO L87 Difference]: Start difference. First operand 6725 states and 22749 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:51,832 INFO L93 Difference]: Finished difference Result 6811 states and 22746 transitions. [2021-07-09 16:51:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-09 16:51:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:51,852 INFO L225 Difference]: With dead ends: 6811 [2021-07-09 16:51:51,852 INFO L226 Difference]: Without dead ends: 6011 [2021-07-09 16:51:51,853 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 159.7ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:51:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2021-07-09 16:51:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 6011. [2021-07-09 16:51:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 3.3537437603993343) internal successors, (20156), 6010 states have internal predecessors, (20156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 20156 transitions. [2021-07-09 16:51:52,039 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 20156 transitions. Word has length 71 [2021-07-09 16:51:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:52,040 INFO L482 AbstractCegarLoop]: Abstraction has 6011 states and 20156 transitions. [2021-07-09 16:51:52,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 20156 transitions. [2021-07-09 16:51:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 16:51:52,051 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:52,051 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:52,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:51:52,051 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash -860155308, now seen corresponding path program 1 times [2021-07-09 16:51:52,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:52,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516001219] [2021-07-09 16:51:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:52,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:52,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516001219] [2021-07-09 16:51:52,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516001219] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:52,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:52,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:51:52,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862237628] [2021-07-09 16:51:52,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:51:52,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:51:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:52,234 INFO L87 Difference]: Start difference. First operand 6011 states and 20156 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:52,447 INFO L93 Difference]: Finished difference Result 6411 states and 21376 transitions. [2021-07-09 16:51:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:51:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 16:51:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:52,466 INFO L225 Difference]: With dead ends: 6411 [2021-07-09 16:51:52,467 INFO L226 Difference]: Without dead ends: 5771 [2021-07-09 16:51:52,467 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 193.7ms TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:51:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2021-07-09 16:51:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5771. [2021-07-09 16:51:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 5770 states have (on average 3.345580589254766) internal successors, (19304), 5770 states have internal predecessors, (19304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 19304 transitions. [2021-07-09 16:51:52,642 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 19304 transitions. Word has length 72 [2021-07-09 16:51:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:52,642 INFO L482 AbstractCegarLoop]: Abstraction has 5771 states and 19304 transitions. [2021-07-09 16:51:52,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 19304 transitions. [2021-07-09 16:51:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 16:51:52,656 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:52,656 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:52,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:51:52,657 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1089295635, now seen corresponding path program 1 times [2021-07-09 16:51:52,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:52,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297934572] [2021-07-09 16:51:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:52,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:52,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297934572] [2021-07-09 16:51:52,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297934572] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:52,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:52,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:52,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484234439] [2021-07-09 16:51:52,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:52,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:52,725 INFO L87 Difference]: Start difference. First operand 5771 states and 19304 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:52,824 INFO L93 Difference]: Finished difference Result 6363 states and 21164 transitions. [2021-07-09 16:51:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:52,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-09 16:51:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:52,842 INFO L225 Difference]: With dead ends: 6363 [2021-07-09 16:51:52,842 INFO L226 Difference]: Without dead ends: 5723 [2021-07-09 16:51:52,843 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2021-07-09 16:51:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5723. [2021-07-09 16:51:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 5722 states have (on average 3.3421880461377143) internal successors, (19124), 5722 states have internal predecessors, (19124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 19124 transitions. [2021-07-09 16:51:52,976 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 19124 transitions. Word has length 72 [2021-07-09 16:51:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:52,977 INFO L482 AbstractCegarLoop]: Abstraction has 5723 states and 19124 transitions. [2021-07-09 16:51:52,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 19124 transitions. [2021-07-09 16:51:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:52,987 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:52,987 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:52,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:51:52,988 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1745837991, now seen corresponding path program 1 times [2021-07-09 16:51:52,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:52,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040673985] [2021-07-09 16:51:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:53,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:53,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040673985] [2021-07-09 16:51:53,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040673985] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:53,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:53,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:53,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612075445] [2021-07-09 16:51:53,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:53,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:53,156 INFO L87 Difference]: Start difference. First operand 5723 states and 19124 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:53,416 INFO L93 Difference]: Finished difference Result 6463 states and 21511 transitions. [2021-07-09 16:51:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 73 [2021-07-09 16:51:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:53,440 INFO L225 Difference]: With dead ends: 6463 [2021-07-09 16:51:53,440 INFO L226 Difference]: Without dead ends: 5863 [2021-07-09 16:51:53,440 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 185.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:51:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5863 states. [2021-07-09 16:51:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5863 to 5863. [2021-07-09 16:51:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5863 states, 5862 states have (on average 3.342033435687479) internal successors, (19591), 5862 states have internal predecessors, (19591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 19591 transitions. [2021-07-09 16:51:53,593 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 19591 transitions. Word has length 73 [2021-07-09 16:51:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:53,594 INFO L482 AbstractCegarLoop]: Abstraction has 5863 states and 19591 transitions. [2021-07-09 16:51:53,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 19591 transitions. [2021-07-09 16:51:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:53,604 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:53,604 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:53,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:51:53,604 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash -511051197, now seen corresponding path program 2 times [2021-07-09 16:51:53,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:53,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61055686] [2021-07-09 16:51:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:53,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:53,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61055686] [2021-07-09 16:51:53,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61055686] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:53,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:53,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:53,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986512736] [2021-07-09 16:51:53,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:53,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:53,835 INFO L87 Difference]: Start difference. First operand 5863 states and 19591 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:54,102 INFO L93 Difference]: Finished difference Result 6477 states and 21546 transitions. [2021-07-09 16:51:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 73 [2021-07-09 16:51:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:54,122 INFO L225 Difference]: With dead ends: 6477 [2021-07-09 16:51:54,123 INFO L226 Difference]: Without dead ends: 5877 [2021-07-09 16:51:54,123 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 198.9ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2021-07-09 16:51:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5849. [2021-07-09 16:51:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 5848 states have (on average 3.3431942544459643) internal successors, (19551), 5848 states have internal predecessors, (19551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 19551 transitions. [2021-07-09 16:51:54,283 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 19551 transitions. Word has length 73 [2021-07-09 16:51:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:54,283 INFO L482 AbstractCegarLoop]: Abstraction has 5849 states and 19551 transitions. [2021-07-09 16:51:54,283 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 19551 transitions. [2021-07-09 16:51:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:54,294 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:54,294 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:54,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:51:54,294 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 345013795, now seen corresponding path program 3 times [2021-07-09 16:51:54,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:54,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585174882] [2021-07-09 16:51:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:54,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:54,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585174882] [2021-07-09 16:51:54,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585174882] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:54,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:54,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:54,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362914564] [2021-07-09 16:51:54,416 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:54,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:54,417 INFO L87 Difference]: Start difference. First operand 5849 states and 19551 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:54,624 INFO L93 Difference]: Finished difference Result 6863 states and 22888 transitions. [2021-07-09 16:51:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 73 [2021-07-09 16:51:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:54,647 INFO L225 Difference]: With dead ends: 6863 [2021-07-09 16:51:54,647 INFO L226 Difference]: Without dead ends: 6263 [2021-07-09 16:51:54,647 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2021-07-09 16:51:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 5877. [2021-07-09 16:51:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5877 states, 5876 states have (on average 3.3396868618107556) internal successors, (19624), 5876 states have internal predecessors, (19624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5877 states to 5877 states and 19624 transitions. [2021-07-09 16:51:54,804 INFO L78 Accepts]: Start accepts. Automaton has 5877 states and 19624 transitions. Word has length 73 [2021-07-09 16:51:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:54,804 INFO L482 AbstractCegarLoop]: Abstraction has 5877 states and 19624 transitions. [2021-07-09 16:51:54,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 5877 states and 19624 transitions. [2021-07-09 16:51:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:54,815 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:54,815 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:54,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:51:54,815 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1163452397, now seen corresponding path program 4 times [2021-07-09 16:51:54,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:54,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682061063] [2021-07-09 16:51:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:54,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:54,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682061063] [2021-07-09 16:51:54,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682061063] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:54,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:54,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:54,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021028027] [2021-07-09 16:51:54,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:54,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:54,943 INFO L87 Difference]: Start difference. First operand 5877 states and 19624 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:55,254 INFO L93 Difference]: Finished difference Result 6883 states and 22922 transitions. [2021-07-09 16:51:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:51:55,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2021-07-09 16:51:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:55,273 INFO L225 Difference]: With dead ends: 6883 [2021-07-09 16:51:55,273 INFO L226 Difference]: Without dead ends: 6203 [2021-07-09 16:51:55,274 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 164.2ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:51:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6203 states. [2021-07-09 16:51:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6203 to 5915. [2021-07-09 16:51:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 3.344098748731823) internal successors, (19777), 5914 states have internal predecessors, (19777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 19777 transitions. [2021-07-09 16:51:55,409 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 19777 transitions. Word has length 73 [2021-07-09 16:51:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:55,409 INFO L482 AbstractCegarLoop]: Abstraction has 5915 states and 19777 transitions. [2021-07-09 16:51:55,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 19777 transitions. [2021-07-09 16:51:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:51:55,419 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:55,419 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:55,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:51:55,420 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash -908356165, now seen corresponding path program 1 times [2021-07-09 16:51:55,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:55,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626977802] [2021-07-09 16:51:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:55,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:55,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626977802] [2021-07-09 16:51:55,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626977802] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:55,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:55,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:55,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663507912] [2021-07-09 16:51:55,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:55,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:55,480 INFO L87 Difference]: Start difference. First operand 5915 states and 19777 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:55,588 INFO L93 Difference]: Finished difference Result 9555 states and 31419 transitions. [2021-07-09 16:51:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2021-07-09 16:51:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:55,607 INFO L225 Difference]: With dead ends: 9555 [2021-07-09 16:51:55,607 INFO L226 Difference]: Without dead ends: 6491 [2021-07-09 16:51:55,607 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2021-07-09 16:51:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 5723. [2021-07-09 16:51:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 5722 states have (on average 3.249737853897239) internal successors, (18595), 5722 states have internal predecessors, (18595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 18595 transitions. [2021-07-09 16:51:55,734 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 18595 transitions. Word has length 73 [2021-07-09 16:51:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:55,734 INFO L482 AbstractCegarLoop]: Abstraction has 5723 states and 18595 transitions. [2021-07-09 16:51:55,734 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 18595 transitions. [2021-07-09 16:51:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:55,744 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:55,744 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:55,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:51:55,744 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash 284003412, now seen corresponding path program 1 times [2021-07-09 16:51:55,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:55,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305721375] [2021-07-09 16:51:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:55,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:55,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305721375] [2021-07-09 16:51:55,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305721375] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:55,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:55,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:55,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061927845] [2021-07-09 16:51:55,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:55,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:55,900 INFO L87 Difference]: Start difference. First operand 5723 states and 18595 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:56,132 INFO L93 Difference]: Finished difference Result 6667 states and 21461 transitions. [2021-07-09 16:51:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:51:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:56,148 INFO L225 Difference]: With dead ends: 6667 [2021-07-09 16:51:56,148 INFO L226 Difference]: Without dead ends: 5962 [2021-07-09 16:51:56,148 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 183.2ms TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:51:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2021-07-09 16:51:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5962. [2021-07-09 16:51:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5962 states, 5961 states have (on average 3.242408991779903) internal successors, (19328), 5961 states have internal predecessors, (19328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 19328 transitions. [2021-07-09 16:51:56,290 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 19328 transitions. Word has length 74 [2021-07-09 16:51:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:56,290 INFO L482 AbstractCegarLoop]: Abstraction has 5962 states and 19328 transitions. [2021-07-09 16:51:56,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 19328 transitions. [2021-07-09 16:51:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:56,302 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:56,302 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:56,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:51:56,302 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -960084680, now seen corresponding path program 2 times [2021-07-09 16:51:56,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:56,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660408333] [2021-07-09 16:51:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:56,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:56,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660408333] [2021-07-09 16:51:56,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660408333] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:56,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:56,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:51:56,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163087256] [2021-07-09 16:51:56,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:51:56,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:51:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:56,579 INFO L87 Difference]: Start difference. First operand 5962 states and 19328 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:56,892 INFO L93 Difference]: Finished difference Result 6492 states and 20956 transitions. [2021-07-09 16:51:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:51:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:56,909 INFO L225 Difference]: With dead ends: 6492 [2021-07-09 16:51:56,909 INFO L226 Difference]: Without dead ends: 5987 [2021-07-09 16:51:56,909 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 276.7ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:51:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2021-07-09 16:51:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 5948. [2021-07-09 16:51:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5948 states, 5947 states have (on average 3.2436522616445265) internal successors, (19290), 5947 states have internal predecessors, (19290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 19290 transitions. [2021-07-09 16:51:57,048 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 19290 transitions. Word has length 74 [2021-07-09 16:51:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:57,048 INFO L482 AbstractCegarLoop]: Abstraction has 5948 states and 19290 transitions. [2021-07-09 16:51:57,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 19290 transitions. [2021-07-09 16:51:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:57,060 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:57,060 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:57,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:51:57,060 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1796957308, now seen corresponding path program 3 times [2021-07-09 16:51:57,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:57,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620044643] [2021-07-09 16:51:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:57,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:57,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620044643] [2021-07-09 16:51:57,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620044643] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:57,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:57,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:51:57,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808100325] [2021-07-09 16:51:57,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:51:57,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:51:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:57,248 INFO L87 Difference]: Start difference. First operand 5948 states and 19290 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:57,608 INFO L93 Difference]: Finished difference Result 8494 states and 27218 transitions. [2021-07-09 16:51:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:51:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:51:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:57,627 INFO L225 Difference]: With dead ends: 8494 [2021-07-09 16:51:57,628 INFO L226 Difference]: Without dead ends: 7209 [2021-07-09 16:51:57,628 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 298.3ms TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:51:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7209 states. [2021-07-09 16:51:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7209 to 5323. [2021-07-09 16:51:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 5322 states have (on average 3.2290492296129276) internal successors, (17185), 5322 states have internal predecessors, (17185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 17185 transitions. [2021-07-09 16:51:57,746 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 17185 transitions. Word has length 74 [2021-07-09 16:51:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:57,747 INFO L482 AbstractCegarLoop]: Abstraction has 5323 states and 17185 transitions. [2021-07-09 16:51:57,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 17185 transitions. [2021-07-09 16:51:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:57,755 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:57,755 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:57,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:51:57,755 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash -191873704, now seen corresponding path program 4 times [2021-07-09 16:51:57,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:57,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059401624] [2021-07-09 16:51:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:57,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:57,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059401624] [2021-07-09 16:51:57,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059401624] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:57,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:57,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:57,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152026386] [2021-07-09 16:51:57,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:57,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:57,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:57,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:57,922 INFO L87 Difference]: Start difference. First operand 5323 states and 17185 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:58,299 INFO L93 Difference]: Finished difference Result 7491 states and 23971 transitions. [2021-07-09 16:51:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:51:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:58,309 INFO L225 Difference]: With dead ends: 7491 [2021-07-09 16:51:58,310 INFO L226 Difference]: Without dead ends: 4661 [2021-07-09 16:51:58,310 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 325.4ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:51:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2021-07-09 16:51:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 3836. [2021-07-09 16:51:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.1994784876140807) internal successors, (12270), 3835 states have internal predecessors, (12270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12270 transitions. [2021-07-09 16:51:58,384 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12270 transitions. Word has length 74 [2021-07-09 16:51:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:58,384 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 12270 transitions. [2021-07-09 16:51:58,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12270 transitions. [2021-07-09 16:51:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:51:58,390 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:58,391 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:58,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:51:58,391 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1149749234, now seen corresponding path program 1 times [2021-07-09 16:51:58,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:58,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363606883] [2021-07-09 16:51:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:58,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:58,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363606883] [2021-07-09 16:51:58,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363606883] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:58,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:58,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:58,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492259933] [2021-07-09 16:51:58,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:58,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:58,455 INFO L87 Difference]: Start difference. First operand 3836 states and 12270 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:58,536 INFO L93 Difference]: Finished difference Result 4692 states and 14710 transitions. [2021-07-09 16:51:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:58,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:51:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:58,543 INFO L225 Difference]: With dead ends: 4692 [2021-07-09 16:51:58,543 INFO L226 Difference]: Without dead ends: 3380 [2021-07-09 16:51:58,544 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2021-07-09 16:51:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3380. [2021-07-09 16:51:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 3.1358390056229655) internal successors, (10596), 3379 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 10596 transitions. [2021-07-09 16:51:58,607 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 10596 transitions. Word has length 74 [2021-07-09 16:51:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:58,608 INFO L482 AbstractCegarLoop]: Abstraction has 3380 states and 10596 transitions. [2021-07-09 16:51:58,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 10596 transitions. [2021-07-09 16:51:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:51:58,613 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:58,613 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:58,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:51:58,613 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2120187312, now seen corresponding path program 1 times [2021-07-09 16:51:58,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:58,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91128617] [2021-07-09 16:51:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:58,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:58,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91128617] [2021-07-09 16:51:58,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91128617] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:58,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:58,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:51:58,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630637895] [2021-07-09 16:51:58,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:51:58,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:51:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:51:58,679 INFO L87 Difference]: Start difference. First operand 3380 states and 10596 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:58,779 INFO L93 Difference]: Finished difference Result 3422 states and 10426 transitions. [2021-07-09 16:51:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:51:58,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-09 16:51:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:58,784 INFO L225 Difference]: With dead ends: 3422 [2021-07-09 16:51:58,785 INFO L226 Difference]: Without dead ends: 2354 [2021-07-09 16:51:58,785 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2021-07-09 16:51:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2021-07-09 16:51:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 3.008924776880578) internal successors, (7080), 2353 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7080 transitions. [2021-07-09 16:51:58,824 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7080 transitions. Word has length 75 [2021-07-09 16:51:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:58,824 INFO L482 AbstractCegarLoop]: Abstraction has 2354 states and 7080 transitions. [2021-07-09 16:51:58,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7080 transitions. [2021-07-09 16:51:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:51:58,828 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:58,828 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:58,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 16:51:58,828 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 56488871, now seen corresponding path program 1 times [2021-07-09 16:51:58,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:58,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922891863] [2021-07-09 16:51:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:58,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:58,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922891863] [2021-07-09 16:51:58,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922891863] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:58,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:58,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:51:58,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339633212] [2021-07-09 16:51:58,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:51:58,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:51:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:51:58,898 INFO L87 Difference]: Start difference. First operand 2354 states and 7080 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:59,003 INFO L93 Difference]: Finished difference Result 1940 states and 5673 transitions. [2021-07-09 16:51:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 77 [2021-07-09 16:51:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:59,006 INFO L225 Difference]: With dead ends: 1940 [2021-07-09 16:51:59,006 INFO L226 Difference]: Without dead ends: 794 [2021-07-09 16:51:59,006 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:51:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-07-09 16:51:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2021-07-09 16:51:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.7919293820933166) internal successors, (2214), 793 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2214 transitions. [2021-07-09 16:51:59,016 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2214 transitions. Word has length 77 [2021-07-09 16:51:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:59,016 INFO L482 AbstractCegarLoop]: Abstraction has 794 states and 2214 transitions. [2021-07-09 16:51:59,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:51:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2214 transitions. [2021-07-09 16:51:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 16:51:59,017 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:59,017 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:51:59,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-09 16:51:59,017 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992908, now seen corresponding path program 1 times [2021-07-09 16:51:59,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:59,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184906102] [2021-07-09 16:51:59,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:59,042 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:59,064 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:59,100 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:51:59,100 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:51:59,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-09 16:51:59,101 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 16:51:59,102 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:51:59,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:51:59 BasicIcfg [2021-07-09 16:51:59,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:51:59,190 INFO L168 Benchmark]: Toolchain (without parser) took 12977.24 ms. Allocated memory was 207.6 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 170.6 MB in the beginning and 1.1 GB in the end (delta: -939.2 MB). Peak memory consumption was 604.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 207.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.65 ms. Allocated memory is still 207.6 MB. Free memory was 170.3 MB in the beginning and 179.7 MB in the end (delta: -9.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.91 ms. Allocated memory is still 207.6 MB. Free memory was 179.7 MB in the beginning and 176.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: Boogie Preprocessor took 32.67 ms. Allocated memory is still 207.6 MB. Free memory was 176.7 MB in the beginning and 174.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: RCFGBuilder took 1372.26 ms. Allocated memory was 207.6 MB in the beginning and 275.8 MB in the end (delta: 68.2 MB). Free memory was 174.6 MB in the beginning and 156.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 106.6 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,190 INFO L168 Benchmark]: TraceAbstraction took 11052.00 ms. Allocated memory was 275.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 155.5 MB in the beginning and 1.1 GB in the end (delta: -954.2 MB). Peak memory consumption was 520.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:59,191 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.11 ms. Allocated memory is still 207.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 448.65 ms. Allocated memory is still 207.6 MB. Free memory was 170.3 MB in the beginning and 179.7 MB in the end (delta: -9.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.91 ms. Allocated memory is still 207.6 MB. Free memory was 179.7 MB in the beginning and 176.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.67 ms. Allocated memory is still 207.6 MB. Free memory was 176.7 MB in the beginning and 174.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1372.26 ms. Allocated memory was 207.6 MB in the beginning and 275.8 MB in the end (delta: 68.2 MB). Free memory was 174.6 MB in the beginning and 156.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 106.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11052.00 ms. Allocated memory was 275.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 155.5 MB in the beginning and 1.1 GB in the end (delta: -954.2 MB). Peak memory consumption was 520.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 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] [L717] 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] [L718] 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] [L719] 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] [L720] 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] [L721] 0 _Bool y$r_buff0_thd3; 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_buff0_thd3=0] [L722] 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_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L733] 0 int z = 0; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L734] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L735] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L811] 0 pthread_t t2504; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L813] 0 pthread_t t2505; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L815] 0 pthread_t t2506; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 515.3ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 36.8ms, AutomataDifference: 84.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 130.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 88 SDtfs, 35 SDslu, 25 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5015occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.8ms SsaConstructionTime, 34.9ms SatisfiabilityAnalysisTime, 106.1ms InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10344.5ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 205.4ms, AutomataDifference: 4545.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 131.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2551 SDtfs, 3832 SDslu, 10726 SDs, 0 SdLazy, 1432 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1300.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2744.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8543occurred in iteration=0, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2594.2ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4970 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.5ms SsaConstructionTime, 454.2ms SatisfiabilityAnalysisTime, 2050.1ms InterpolantComputationTime, 1387 NumberOfCodeBlocks, 1387 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 7771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...