/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/concurrent/pthreads/forkFork.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-22 01:21:30,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-22 01:21:30,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-22 01:21:30,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-22 01:21:30,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-22 01:21:30,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-22 01:21:30,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-22 01:21:30,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-22 01:21:30,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-22 01:21:30,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-22 01:21:30,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-22 01:21:30,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-22 01:21:30,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-22 01:21:30,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-22 01:21:30,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-22 01:21:30,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-22 01:21:30,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-22 01:21:30,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-22 01:21:30,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-22 01:21:30,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-22 01:21:30,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-22 01:21:30,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-22 01:21:30,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-22 01:21:30,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-22 01:21:30,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-22 01:21:30,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-22 01:21:30,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-22 01:21:30,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-22 01:21:30,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-22 01:21:30,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-22 01:21:30,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-22 01:21:30,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-22 01:21:30,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-22 01:21:30,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-22 01:21:30,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-22 01:21:30,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-22 01:21:30,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-22 01:21:30,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-22 01:21:30,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-22 01:21:30,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-22 01:21:30,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-22 01:21:30,271 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-Separate.epf [2021-05-22 01:21:30,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-22 01:21:30,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-22 01:21:30,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-22 01:21:30,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-22 01:21:30,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-22 01:21:30,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-22 01:21:30,309 INFO L138 SettingsManager]: * Use SBE=true [2021-05-22 01:21:30,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-22 01:21:30,310 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-22 01:21:30,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-22 01:21:30,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-22 01:21:30,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-22 01:21:30,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-22 01:21:30,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-22 01:21:30,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-22 01:21:30,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-22 01:21:30,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-22 01:21:30,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-22 01:21:30,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-22 01:21:30,313 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-05-22 01:21:30,314 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-05-22 01:21:30,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-22 01:21:30,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-22 01:21:30,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-22 01:21:30,656 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-22 01:21:30,656 INFO L275 PluginConnector]: CDTParser initialized [2021-05-22 01:21:30,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/forkFork.c [2021-05-22 01:21:30,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731b33777/daef8e72b03444b1bfa81f5f8371f2e7/FLAG8fa374480 [2021-05-22 01:21:31,206 INFO L306 CDTParser]: Found 1 translation units. [2021-05-22 01:21:31,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/forkFork.c [2021-05-22 01:21:31,207 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-05-22 01:21:31,207 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2021-05-22 01:21:31,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731b33777/daef8e72b03444b1bfa81f5f8371f2e7/FLAG8fa374480 [2021-05-22 01:21:31,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731b33777/daef8e72b03444b1bfa81f5f8371f2e7 [2021-05-22 01:21:31,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-22 01:21:31,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-22 01:21:31,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-22 01:21:31,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-22 01:21:31,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-22 01:21:31,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2dc8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31, skipping insertion in model container [2021-05-22 01:21:31,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-22 01:21:31,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-22 01:21:31,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-22 01:21:31,895 INFO L203 MainTranslator]: Completed pre-run [2021-05-22 01:21:31,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-22 01:21:31,918 INFO L208 MainTranslator]: Completed translation [2021-05-22 01:21:31,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31 WrapperNode [2021-05-22 01:21:31,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-22 01:21:31,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-22 01:21:31,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-22 01:21:31,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-22 01:21:31,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-22 01:21:31,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-22 01:21:31,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-22 01:21:31,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-22 01:21:31,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (1/1) ... [2021-05-22 01:21:31,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-22 01:21:31,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-22 01:21:31,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-22 01:21:31,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-22 01:21:31,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (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-05-22 01:21:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-22 01:21:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-22 01:21:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2021-05-22 01:21:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2021-05-22 01:21:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-05-22 01:21:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-05-22 01:21:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-22 01:21:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-22 01:21:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-22 01:21:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-22 01:21:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-22 01:21:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-22 01:21:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-22 01:21:32,042 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-22 01:21:32,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-22 01:21:32,434 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-05-22 01:21:32,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.05 01:21:32 BoogieIcfgContainer [2021-05-22 01:21:32,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-22 01:21:32,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-22 01:21:32,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-22 01:21:32,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-22 01:21:32,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.05 01:21:31" (1/3) ... [2021-05-22 01:21:32,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7ec98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.05 01:21:32, skipping insertion in model container [2021-05-22 01:21:32,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.05 01:21:31" (2/3) ... [2021-05-22 01:21:32,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7ec98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.05 01:21:32, skipping insertion in model container [2021-05-22 01:21:32,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.05 01:21:32" (3/3) ... [2021-05-22 01:21:32,442 INFO L111 eAbstractionObserver]: Analyzing ICFG forkFork.c [2021-05-22 01:21:32,447 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-22 01:21:32,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-22 01:21:32,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-05-22 01:21:32,448 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-22 01:21:32,480 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,481 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,482 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,482 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,482 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,482 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,482 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,483 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,484 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,485 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,485 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,485 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,485 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,485 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,486 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,486 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,486 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,486 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,486 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,487 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,488 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,488 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,488 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,488 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,489 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,489 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,489 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,489 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,489 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,490 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,490 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,490 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,490 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,490 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,491 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,491 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,491 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,491 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,492 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,493 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,494 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,495 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,495 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,495 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,495 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,495 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,496 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,496 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,496 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,496 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,496 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,497 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,497 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,497 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,497 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,497 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,498 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,498 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,498 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,498 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,498 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,499 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,499 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,499 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,499 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,500 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,501 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,502 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,503 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,504 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,505 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,507 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,508 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,509 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,509 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,514 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,514 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,514 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,514 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,514 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,515 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,516 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,516 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,516 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,516 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,516 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,519 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,519 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,520 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:21:32,548 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-05-22 01:21:32,567 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-22 01:21:32,584 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-22 01:21:32,584 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-22 01:21:32,584 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-22 01:21:32,584 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-22 01:21:32,585 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-22 01:21:32,585 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-22 01:21:32,585 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-22 01:21:32,585 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-22 01:21:32,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 89 transitions, 206 flow [2021-05-22 01:21:32,625 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 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-05-22 01:21:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 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-05-22 01:21:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-22 01:21:32,637 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:32,638 INFO L521 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] [2021-05-22 01:21:32,638 INFO L430 AbstractCegarLoop]: === Iteration 1 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1964643420, now seen corresponding path program 1 times [2021-05-22 01:21:32,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:32,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796305967] [2021-05-22 01:21:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:33,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:33,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796305967] [2021-05-22 01:21:33,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796305967] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:33,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:33,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-22 01:21:33,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210124134] [2021-05-22 01:21:33,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-22 01:21:33,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-22 01:21:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-05-22 01:21:33,169 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 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 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 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-05-22 01:21:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:34,147 INFO L93 Difference]: Finished difference Result 457 states and 961 transitions. [2021-05-22 01:21:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-22 01:21:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-05-22 01:21:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:34,165 INFO L225 Difference]: With dead ends: 457 [2021-05-22 01:21:34,165 INFO L226 Difference]: Without dead ends: 407 [2021-05-22 01:21:34,167 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 811.9ms TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2021-05-22 01:21:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-05-22 01:21:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-05-22 01:21:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 405 states have (on average 2.1753086419753087) internal successors, (881), 406 states have internal predecessors, (881), 0 states have call successors, (0), 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-05-22 01:21:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 881 transitions. [2021-05-22 01:21:34,222 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 881 transitions. Word has length 26 [2021-05-22 01:21:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:34,223 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 881 transitions. [2021-05-22 01:21:34,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 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-05-22 01:21:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 881 transitions. [2021-05-22 01:21:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-22 01:21:34,227 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:34,227 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:34,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-22 01:21:34,227 INFO L430 AbstractCegarLoop]: === Iteration 2 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash 982709772, now seen corresponding path program 1 times [2021-05-22 01:21:34,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:34,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244265205] [2021-05-22 01:21:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:34,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:34,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244265205] [2021-05-22 01:21:34,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244265205] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:34,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:34,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-22 01:21:34,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450742096] [2021-05-22 01:21:34,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-22 01:21:34,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-22 01:21:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-22 01:21:34,687 INFO L87 Difference]: Start difference. First operand 407 states and 881 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:34,932 INFO L93 Difference]: Finished difference Result 473 states and 981 transitions. [2021-05-22 01:21:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-22 01:21:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-05-22 01:21:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:34,935 INFO L225 Difference]: With dead ends: 473 [2021-05-22 01:21:34,935 INFO L226 Difference]: Without dead ends: 473 [2021-05-22 01:21:34,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 275.0ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-22 01:21:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-05-22 01:21:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 458. [2021-05-22 01:21:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 456 states have (on average 2.1184210526315788) internal successors, (966), 457 states have internal predecessors, (966), 0 states have call successors, (0), 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-05-22 01:21:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 966 transitions. [2021-05-22 01:21:34,956 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 966 transitions. Word has length 46 [2021-05-22 01:21:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:34,957 INFO L482 AbstractCegarLoop]: Abstraction has 458 states and 966 transitions. [2021-05-22 01:21:34,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 966 transitions. [2021-05-22 01:21:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-22 01:21:34,959 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:34,959 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:34,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-22 01:21:34,960 INFO L430 AbstractCegarLoop]: === Iteration 3 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1370098458, now seen corresponding path program 2 times [2021-05-22 01:21:34,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:34,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397564247] [2021-05-22 01:21:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:35,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:35,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397564247] [2021-05-22 01:21:35,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397564247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:35,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:35,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-22 01:21:35,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386973834] [2021-05-22 01:21:35,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-22 01:21:35,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-22 01:21:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-22 01:21:35,204 INFO L87 Difference]: Start difference. First operand 458 states and 966 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:35,447 INFO L93 Difference]: Finished difference Result 522 states and 1064 transitions. [2021-05-22 01:21:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-22 01:21:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-05-22 01:21:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:35,451 INFO L225 Difference]: With dead ends: 522 [2021-05-22 01:21:35,451 INFO L226 Difference]: Without dead ends: 522 [2021-05-22 01:21:35,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 237.5ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-05-22 01:21:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-05-22 01:21:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2021-05-22 01:21:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 454 states have (on average 2.1233480176211454) internal successors, (964), 455 states have internal predecessors, (964), 0 states have call successors, (0), 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-05-22 01:21:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 964 transitions. [2021-05-22 01:21:35,465 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 964 transitions. Word has length 46 [2021-05-22 01:21:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:35,466 INFO L482 AbstractCegarLoop]: Abstraction has 456 states and 964 transitions. [2021-05-22 01:21:35,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 964 transitions. [2021-05-22 01:21:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-22 01:21:35,467 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:35,468 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:35,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-22 01:21:35,468 INFO L430 AbstractCegarLoop]: === Iteration 4 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:35,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1272071898, now seen corresponding path program 3 times [2021-05-22 01:21:35,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:35,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509473047] [2021-05-22 01:21:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:35,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:35,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509473047] [2021-05-22 01:21:35,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509473047] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:35,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:35,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-22 01:21:35,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304669842] [2021-05-22 01:21:35,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-22 01:21:35,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-22 01:21:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-22 01:21:35,967 INFO L87 Difference]: Start difference. First operand 456 states and 964 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:36,600 INFO L93 Difference]: Finished difference Result 577 states and 1161 transitions. [2021-05-22 01:21:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-22 01:21:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-05-22 01:21:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:36,603 INFO L225 Difference]: With dead ends: 577 [2021-05-22 01:21:36,604 INFO L226 Difference]: Without dead ends: 577 [2021-05-22 01:21:36,604 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 571.8ms TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2021-05-22 01:21:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-05-22 01:21:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 455. [2021-05-22 01:21:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.1258278145695364) internal successors, (963), 454 states have internal predecessors, (963), 0 states have call successors, (0), 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-05-22 01:21:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 963 transitions. [2021-05-22 01:21:36,619 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 963 transitions. Word has length 46 [2021-05-22 01:21:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:36,619 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 963 transitions. [2021-05-22 01:21:36,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 963 transitions. [2021-05-22 01:21:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-22 01:21:36,621 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:36,621 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:36,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-22 01:21:36,621 INFO L430 AbstractCegarLoop]: === Iteration 5 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 240206360, now seen corresponding path program 4 times [2021-05-22 01:21:36,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:36,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079963700] [2021-05-22 01:21:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:36,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:36,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079963700] [2021-05-22 01:21:36,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079963700] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:36,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:36,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-22 01:21:36,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619426272] [2021-05-22 01:21:36,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-22 01:21:36,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-22 01:21:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-22 01:21:36,955 INFO L87 Difference]: Start difference. First operand 455 states and 963 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:37,522 INFO L93 Difference]: Finished difference Result 486 states and 1004 transitions. [2021-05-22 01:21:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-22 01:21:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-05-22 01:21:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:37,525 INFO L225 Difference]: With dead ends: 486 [2021-05-22 01:21:37,525 INFO L226 Difference]: Without dead ends: 486 [2021-05-22 01:21:37,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 447.0ms TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-05-22 01:21:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-05-22 01:21:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 423. [2021-05-22 01:21:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 421 states have (on average 2.1543942992874108) internal successors, (907), 422 states have internal predecessors, (907), 0 states have call successors, (0), 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-05-22 01:21:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 907 transitions. [2021-05-22 01:21:37,537 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 907 transitions. Word has length 46 [2021-05-22 01:21:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:37,537 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 907 transitions. [2021-05-22 01:21:37,537 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 907 transitions. [2021-05-22 01:21:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-22 01:21:37,538 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:37,538 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:37,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-22 01:21:37,539 INFO L430 AbstractCegarLoop]: === Iteration 6 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1884213040, now seen corresponding path program 5 times [2021-05-22 01:21:37,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:37,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481173599] [2021-05-22 01:21:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:37,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:37,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481173599] [2021-05-22 01:21:37,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481173599] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:37,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:37,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-22 01:21:37,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370165803] [2021-05-22 01:21:37,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-22 01:21:37,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-22 01:21:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-05-22 01:21:37,931 INFO L87 Difference]: Start difference. First operand 423 states and 907 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:39,206 INFO L93 Difference]: Finished difference Result 442 states and 923 transitions. [2021-05-22 01:21:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-22 01:21:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-05-22 01:21:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:39,208 INFO L225 Difference]: With dead ends: 442 [2021-05-22 01:21:39,209 INFO L226 Difference]: Without dead ends: 442 [2021-05-22 01:21:39,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 987.8ms TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2021-05-22 01:21:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-05-22 01:21:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 363. [2021-05-22 01:21:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.2099447513812156) internal successors, (800), 362 states have internal predecessors, (800), 0 states have call successors, (0), 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-05-22 01:21:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 800 transitions. [2021-05-22 01:21:39,218 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 800 transitions. Word has length 46 [2021-05-22 01:21:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:39,218 INFO L482 AbstractCegarLoop]: Abstraction has 363 states and 800 transitions. [2021-05-22 01:21:39,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 800 transitions. [2021-05-22 01:21:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:39,219 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:39,220 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:39,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-22 01:21:39,220 INFO L430 AbstractCegarLoop]: === Iteration 7 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1424997685, now seen corresponding path program 1 times [2021-05-22 01:21:39,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:39,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511066384] [2021-05-22 01:21:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:39,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:39,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511066384] [2021-05-22 01:21:39,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511066384] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:39,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:39,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:21:39,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693960496] [2021-05-22 01:21:39,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:21:39,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:39,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:21:39,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:21:39,662 INFO L87 Difference]: Start difference. First operand 363 states and 800 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:41,245 INFO L93 Difference]: Finished difference Result 507 states and 1077 transitions. [2021-05-22 01:21:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:21:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:41,247 INFO L225 Difference]: With dead ends: 507 [2021-05-22 01:21:41,247 INFO L226 Difference]: Without dead ends: 361 [2021-05-22 01:21:41,248 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1361.2ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:21:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-05-22 01:21:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2021-05-22 01:21:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.2111111111111112) internal successors, (796), 360 states have internal predecessors, (796), 0 states have call successors, (0), 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-05-22 01:21:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 796 transitions. [2021-05-22 01:21:41,256 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 796 transitions. Word has length 61 [2021-05-22 01:21:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:41,256 INFO L482 AbstractCegarLoop]: Abstraction has 361 states and 796 transitions. [2021-05-22 01:21:41,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 796 transitions. [2021-05-22 01:21:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:41,257 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:41,258 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:41,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-22 01:21:41,258 INFO L430 AbstractCegarLoop]: === Iteration 8 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1323525531, now seen corresponding path program 2 times [2021-05-22 01:21:41,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:41,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165018753] [2021-05-22 01:21:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:41,671 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:41,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165018753] [2021-05-22 01:21:41,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165018753] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:41,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:41,671 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:21:41,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543074150] [2021-05-22 01:21:41,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:21:41,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:21:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:21:41,676 INFO L87 Difference]: Start difference. First operand 361 states and 796 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:43,286 INFO L93 Difference]: Finished difference Result 501 states and 1067 transitions. [2021-05-22 01:21:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:21:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:43,288 INFO L225 Difference]: With dead ends: 501 [2021-05-22 01:21:43,288 INFO L226 Difference]: Without dead ends: 357 [2021-05-22 01:21:43,289 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1328.3ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:21:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-05-22 01:21:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-05-22 01:21:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.2134831460674156) internal successors, (788), 356 states have internal predecessors, (788), 0 states have call successors, (0), 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-05-22 01:21:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 788 transitions. [2021-05-22 01:21:43,296 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 788 transitions. Word has length 61 [2021-05-22 01:21:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:43,296 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 788 transitions. [2021-05-22 01:21:43,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 788 transitions. [2021-05-22 01:21:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:43,297 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:43,297 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:43,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-22 01:21:43,298 INFO L430 AbstractCegarLoop]: === Iteration 9 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -823634075, now seen corresponding path program 3 times [2021-05-22 01:21:43,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:43,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115707481] [2021-05-22 01:21:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:43,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:43,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115707481] [2021-05-22 01:21:43,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115707481] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:43,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:43,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:21:43,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844550393] [2021-05-22 01:21:43,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:21:43,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:43,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:21:43,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:21:43,680 INFO L87 Difference]: Start difference. First operand 357 states and 788 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:45,591 INFO L93 Difference]: Finished difference Result 611 states and 1298 transitions. [2021-05-22 01:21:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-22 01:21:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:45,594 INFO L225 Difference]: With dead ends: 611 [2021-05-22 01:21:45,594 INFO L226 Difference]: Without dead ends: 473 [2021-05-22 01:21:45,595 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1691.4ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:21:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-05-22 01:21:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 357. [2021-05-22 01:21:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.202247191011236) internal successors, (784), 356 states have internal predecessors, (784), 0 states have call successors, (0), 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-05-22 01:21:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 784 transitions. [2021-05-22 01:21:45,603 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 784 transitions. Word has length 61 [2021-05-22 01:21:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:45,603 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 784 transitions. [2021-05-22 01:21:45,603 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 784 transitions. [2021-05-22 01:21:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:45,604 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:45,604 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:45,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-22 01:21:45,605 INFO L430 AbstractCegarLoop]: === Iteration 10 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2085424731, now seen corresponding path program 4 times [2021-05-22 01:21:45,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:45,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066853538] [2021-05-22 01:21:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:46,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:46,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066853538] [2021-05-22 01:21:46,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066853538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:46,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:46,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:46,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608664962] [2021-05-22 01:21:46,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:46,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:46,037 INFO L87 Difference]: Start difference. First operand 357 states and 784 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:47,658 INFO L93 Difference]: Finished difference Result 471 states and 1004 transitions. [2021-05-22 01:21:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-22 01:21:47,659 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:47,660 INFO L225 Difference]: With dead ends: 471 [2021-05-22 01:21:47,660 INFO L226 Difference]: Without dead ends: 373 [2021-05-22 01:21:47,661 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1372.4ms TimeCoverageRelationStatistics Valid=569, Invalid=3091, Unknown=0, NotChecked=0, Total=3660 [2021-05-22 01:21:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-05-22 01:21:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2021-05-22 01:21:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1797752808988764) internal successors, (776), 356 states have internal predecessors, (776), 0 states have call successors, (0), 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-05-22 01:21:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 776 transitions. [2021-05-22 01:21:47,668 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 776 transitions. Word has length 61 [2021-05-22 01:21:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:47,668 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 776 transitions. [2021-05-22 01:21:47,669 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 776 transitions. [2021-05-22 01:21:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:47,669 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:47,669 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:47,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-22 01:21:47,670 INFO L430 AbstractCegarLoop]: === Iteration 11 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1071374389, now seen corresponding path program 5 times [2021-05-22 01:21:47,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:47,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005175841] [2021-05-22 01:21:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:48,033 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:48,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005175841] [2021-05-22 01:21:48,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005175841] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:48,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:48,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:21:48,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925248517] [2021-05-22 01:21:48,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:21:48,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:21:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:21:48,039 INFO L87 Difference]: Start difference. First operand 357 states and 776 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:49,470 INFO L93 Difference]: Finished difference Result 447 states and 942 transitions. [2021-05-22 01:21:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:21:49,470 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:49,472 INFO L225 Difference]: With dead ends: 447 [2021-05-22 01:21:49,472 INFO L226 Difference]: Without dead ends: 365 [2021-05-22 01:21:49,473 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1215.4ms TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:21:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-05-22 01:21:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-05-22 01:21:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.168539325842697) internal successors, (772), 356 states have internal predecessors, (772), 0 states have call successors, (0), 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-05-22 01:21:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 772 transitions. [2021-05-22 01:21:49,480 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 772 transitions. Word has length 61 [2021-05-22 01:21:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:49,480 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 772 transitions. [2021-05-22 01:21:49,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 772 transitions. [2021-05-22 01:21:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:49,481 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:49,481 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:49,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-22 01:21:49,481 INFO L430 AbstractCegarLoop]: === Iteration 12 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708235, now seen corresponding path program 6 times [2021-05-22 01:21:49,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:49,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252342354] [2021-05-22 01:21:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:49,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:49,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252342354] [2021-05-22 01:21:49,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252342354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:49,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:49,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:21:49,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065459944] [2021-05-22 01:21:49,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:21:49,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:21:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:21:49,866 INFO L87 Difference]: Start difference. First operand 357 states and 772 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:51,393 INFO L93 Difference]: Finished difference Result 439 states and 920 transitions. [2021-05-22 01:21:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-22 01:21:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:51,395 INFO L225 Difference]: With dead ends: 439 [2021-05-22 01:21:51,395 INFO L226 Difference]: Without dead ends: 365 [2021-05-22 01:21:51,396 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1326.1ms TimeCoverageRelationStatistics Valid=566, Invalid=3094, Unknown=0, NotChecked=0, Total=3660 [2021-05-22 01:21:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-05-22 01:21:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-05-22 01:21:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.157303370786517) internal successors, (768), 356 states have internal predecessors, (768), 0 states have call successors, (0), 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-05-22 01:21:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 768 transitions. [2021-05-22 01:21:51,403 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 768 transitions. Word has length 61 [2021-05-22 01:21:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:51,403 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 768 transitions. [2021-05-22 01:21:51,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 768 transitions. [2021-05-22 01:21:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:51,404 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:51,404 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:51,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-22 01:21:51,404 INFO L430 AbstractCegarLoop]: === Iteration 13 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1648857061, now seen corresponding path program 7 times [2021-05-22 01:21:51,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:51,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951406101] [2021-05-22 01:21:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:51,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:51,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951406101] [2021-05-22 01:21:51,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951406101] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:51,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:51,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:51,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380629001] [2021-05-22 01:21:51,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:51,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:51,757 INFO L87 Difference]: Start difference. First operand 357 states and 768 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:53,185 INFO L93 Difference]: Finished difference Result 459 states and 942 transitions. [2021-05-22 01:21:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-22 01:21:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:53,187 INFO L225 Difference]: With dead ends: 459 [2021-05-22 01:21:53,187 INFO L226 Difference]: Without dead ends: 393 [2021-05-22 01:21:53,188 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1208.3ms TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2021-05-22 01:21:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-05-22 01:21:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 357. [2021-05-22 01:21:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.134831460674157) internal successors, (760), 356 states have internal predecessors, (760), 0 states have call successors, (0), 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-05-22 01:21:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 760 transitions. [2021-05-22 01:21:53,195 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 760 transitions. Word has length 61 [2021-05-22 01:21:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:53,195 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 760 transitions. [2021-05-22 01:21:53,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 760 transitions. [2021-05-22 01:21:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:53,196 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:53,196 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:53,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-22 01:21:53,196 INFO L430 AbstractCegarLoop]: === Iteration 14 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 146013925, now seen corresponding path program 8 times [2021-05-22 01:21:53,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:53,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073424542] [2021-05-22 01:21:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:53,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:53,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073424542] [2021-05-22 01:21:53,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073424542] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:53,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:53,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:53,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389493225] [2021-05-22 01:21:53,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:53,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:53,568 INFO L87 Difference]: Start difference. First operand 357 states and 760 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:54,958 INFO L93 Difference]: Finished difference Result 427 states and 866 transitions. [2021-05-22 01:21:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-22 01:21:54,959 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:54,960 INFO L225 Difference]: With dead ends: 427 [2021-05-22 01:21:54,960 INFO L226 Difference]: Without dead ends: 377 [2021-05-22 01:21:54,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1189.3ms TimeCoverageRelationStatistics Valid=556, Invalid=2984, Unknown=0, NotChecked=0, Total=3540 [2021-05-22 01:21:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-05-22 01:21:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2021-05-22 01:21:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1123595505617976) internal successors, (752), 356 states have internal predecessors, (752), 0 states have call successors, (0), 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-05-22 01:21:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 752 transitions. [2021-05-22 01:21:54,968 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 752 transitions. Word has length 61 [2021-05-22 01:21:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:54,968 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 752 transitions. [2021-05-22 01:21:54,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 752 transitions. [2021-05-22 01:21:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:54,969 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:54,969 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:54,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-22 01:21:54,969 INFO L430 AbstractCegarLoop]: === Iteration 15 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1525657893, now seen corresponding path program 9 times [2021-05-22 01:21:54,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:54,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556958480] [2021-05-22 01:21:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:55,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:55,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556958480] [2021-05-22 01:21:55,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556958480] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:55,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:55,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:55,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739462598] [2021-05-22 01:21:55,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:55,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:55,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:55,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:55,333 INFO L87 Difference]: Start difference. First operand 357 states and 752 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:56,710 INFO L93 Difference]: Finished difference Result 393 states and 799 transitions. [2021-05-22 01:21:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:21:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:56,711 INFO L225 Difference]: With dead ends: 393 [2021-05-22 01:21:56,711 INFO L226 Difference]: Without dead ends: 359 [2021-05-22 01:21:56,712 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1191.8ms TimeCoverageRelationStatistics Valid=547, Invalid=2993, Unknown=0, NotChecked=0, Total=3540 [2021-05-22 01:21:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-05-22 01:21:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2021-05-22 01:21:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.109550561797753) internal successors, (751), 356 states have internal predecessors, (751), 0 states have call successors, (0), 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-05-22 01:21:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 751 transitions. [2021-05-22 01:21:56,719 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 751 transitions. Word has length 61 [2021-05-22 01:21:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:56,719 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 751 transitions. [2021-05-22 01:21:56,719 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 751 transitions. [2021-05-22 01:21:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:56,720 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:56,720 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:56,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-22 01:21:56,720 INFO L430 AbstractCegarLoop]: === Iteration 16 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:56,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1243524661, now seen corresponding path program 10 times [2021-05-22 01:21:56,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:56,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601633809] [2021-05-22 01:21:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:57,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:57,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601633809] [2021-05-22 01:21:57,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601633809] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:57,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:57,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:57,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680915137] [2021-05-22 01:21:57,113 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:57,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:57,114 INFO L87 Difference]: Start difference. First operand 357 states and 751 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:21:58,568 INFO L93 Difference]: Finished difference Result 401 states and 810 transitions. [2021-05-22 01:21:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-22 01:21:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:21:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:21:58,570 INFO L225 Difference]: With dead ends: 401 [2021-05-22 01:21:58,570 INFO L226 Difference]: Without dead ends: 369 [2021-05-22 01:21:58,571 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1281.4ms TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2021-05-22 01:21:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-05-22 01:21:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2021-05-22 01:21:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.101123595505618) internal successors, (748), 356 states have internal predecessors, (748), 0 states have call successors, (0), 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-05-22 01:21:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 748 transitions. [2021-05-22 01:21:58,577 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 748 transitions. Word has length 61 [2021-05-22 01:21:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:21:58,577 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 748 transitions. [2021-05-22 01:21:58,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:21:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 748 transitions. [2021-05-22 01:21:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:21:58,578 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:21:58,578 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:21:58,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-22 01:21:58,579 INFO L430 AbstractCegarLoop]: === Iteration 17 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:21:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:21:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash -666611931, now seen corresponding path program 11 times [2021-05-22 01:21:58,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:21:58,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083228086] [2021-05-22 01:21:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:21:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:21:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:21:58,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:21:58,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083228086] [2021-05-22 01:21:58,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083228086] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:21:58,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:21:58,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:21:58,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802758570] [2021-05-22 01:21:58,967 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:21:58,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:21:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:21:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:21:58,968 INFO L87 Difference]: Start difference. First operand 357 states and 748 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:00,319 INFO L93 Difference]: Finished difference Result 385 states and 783 transitions. [2021-05-22 01:22:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-22 01:22:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:00,320 INFO L225 Difference]: With dead ends: 385 [2021-05-22 01:22:00,320 INFO L226 Difference]: Without dead ends: 359 [2021-05-22 01:22:00,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1184.4ms TimeCoverageRelationStatistics Valid=543, Invalid=2879, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-05-22 01:22:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2021-05-22 01:22:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.098314606741573) internal successors, (747), 356 states have internal predecessors, (747), 0 states have call successors, (0), 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-05-22 01:22:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 747 transitions. [2021-05-22 01:22:00,326 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 747 transitions. Word has length 61 [2021-05-22 01:22:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:00,326 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 747 transitions. [2021-05-22 01:22:00,326 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 747 transitions. [2021-05-22 01:22:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:00,327 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:00,327 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:00,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-22 01:22:00,327 INFO L430 AbstractCegarLoop]: === Iteration 18 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1258030027, now seen corresponding path program 12 times [2021-05-22 01:22:00,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:00,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013932716] [2021-05-22 01:22:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:00,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:00,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013932716] [2021-05-22 01:22:00,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013932716] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:00,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:00,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-22 01:22:00,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632767288] [2021-05-22 01:22:00,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-22 01:22:00,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-22 01:22:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-05-22 01:22:00,692 INFO L87 Difference]: Start difference. First operand 357 states and 747 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:02,058 INFO L93 Difference]: Finished difference Result 381 states and 776 transitions. [2021-05-22 01:22:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:02,059 INFO L225 Difference]: With dead ends: 381 [2021-05-22 01:22:02,059 INFO L226 Difference]: Without dead ends: 357 [2021-05-22 01:22:02,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1185.6ms TimeCoverageRelationStatistics Valid=572, Invalid=2968, Unknown=0, NotChecked=0, Total=3540 [2021-05-22 01:22:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-05-22 01:22:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-05-22 01:22:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.092696629213483) internal successors, (745), 356 states have internal predecessors, (745), 0 states have call successors, (0), 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-05-22 01:22:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 745 transitions. [2021-05-22 01:22:02,066 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 745 transitions. Word has length 61 [2021-05-22 01:22:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:02,067 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 745 transitions. [2021-05-22 01:22:02,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 745 transitions. [2021-05-22 01:22:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:02,068 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:02,068 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:02,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-22 01:22:02,068 INFO L430 AbstractCegarLoop]: === Iteration 19 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1564219701, now seen corresponding path program 13 times [2021-05-22 01:22:02,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:02,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831434885] [2021-05-22 01:22:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:02,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:02,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831434885] [2021-05-22 01:22:02,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831434885] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:02,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:02,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-22 01:22:02,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92676813] [2021-05-22 01:22:02,489 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-22 01:22:02,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-22 01:22:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2021-05-22 01:22:02,490 INFO L87 Difference]: Start difference. First operand 357 states and 745 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:04,694 INFO L93 Difference]: Finished difference Result 377 states and 768 transitions. [2021-05-22 01:22:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-22 01:22:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:04,695 INFO L225 Difference]: With dead ends: 377 [2021-05-22 01:22:04,695 INFO L226 Difference]: Without dead ends: 225 [2021-05-22 01:22:04,696 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1991.5ms TimeCoverageRelationStatistics Valid=633, Invalid=3789, Unknown=0, NotChecked=0, Total=4422 [2021-05-22 01:22:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-22 01:22:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-05-22 01:22:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.9866071428571428) internal successors, (445), 224 states have internal predecessors, (445), 0 states have call successors, (0), 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-05-22 01:22:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 445 transitions. [2021-05-22 01:22:04,700 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 445 transitions. Word has length 61 [2021-05-22 01:22:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:04,700 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 445 transitions. [2021-05-22 01:22:04,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 445 transitions. [2021-05-22 01:22:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:04,701 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:04,701 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:04,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-22 01:22:04,701 INFO L430 AbstractCegarLoop]: === Iteration 20 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1000025979, now seen corresponding path program 14 times [2021-05-22 01:22:04,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:04,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431987880] [2021-05-22 01:22:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:05,086 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:05,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431987880] [2021-05-22 01:22:05,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431987880] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:05,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:05,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:22:05,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878449349] [2021-05-22 01:22:05,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:22:05,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:22:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:22:05,088 INFO L87 Difference]: Start difference. First operand 225 states and 445 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:07,001 INFO L93 Difference]: Finished difference Result 331 states and 647 transitions. [2021-05-22 01:22:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:07,003 INFO L225 Difference]: With dead ends: 331 [2021-05-22 01:22:07,003 INFO L226 Difference]: Without dead ends: 213 [2021-05-22 01:22:07,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1690.5ms TimeCoverageRelationStatistics Valid=516, Invalid=2906, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-05-22 01:22:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-05-22 01:22:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.9433962264150944) internal successors, (412), 212 states have internal predecessors, (412), 0 states have call successors, (0), 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-05-22 01:22:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 412 transitions. [2021-05-22 01:22:07,007 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 412 transitions. Word has length 61 [2021-05-22 01:22:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:07,007 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 412 transitions. [2021-05-22 01:22:07,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 412 transitions. [2021-05-22 01:22:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:07,008 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:07,008 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:07,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-22 01:22:07,008 INFO L430 AbstractCegarLoop]: === Iteration 21 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -445291639, now seen corresponding path program 15 times [2021-05-22 01:22:07,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:07,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114425470] [2021-05-22 01:22:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:07,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:07,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114425470] [2021-05-22 01:22:07,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114425470] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:07,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:07,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:22:07,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039080866] [2021-05-22 01:22:07,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:22:07,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:22:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:22:07,372 INFO L87 Difference]: Start difference. First operand 213 states and 412 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:09,163 INFO L93 Difference]: Finished difference Result 327 states and 632 transitions. [2021-05-22 01:22:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:09,164 INFO L225 Difference]: With dead ends: 327 [2021-05-22 01:22:09,164 INFO L226 Difference]: Without dead ends: 201 [2021-05-22 01:22:09,165 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1657.9ms TimeCoverageRelationStatistics Valid=545, Invalid=2877, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-05-22 01:22:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-05-22 01:22:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.895) internal successors, (379), 200 states have internal predecessors, (379), 0 states have call successors, (0), 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-05-22 01:22:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 379 transitions. [2021-05-22 01:22:09,167 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 379 transitions. Word has length 61 [2021-05-22 01:22:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:09,168 INFO L482 AbstractCegarLoop]: Abstraction has 201 states and 379 transitions. [2021-05-22 01:22:09,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 379 transitions. [2021-05-22 01:22:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:09,168 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:09,169 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:09,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-22 01:22:09,169 INFO L430 AbstractCegarLoop]: === Iteration 22 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2088814595, now seen corresponding path program 16 times [2021-05-22 01:22:09,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:09,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536528407] [2021-05-22 01:22:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:09,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:09,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536528407] [2021-05-22 01:22:09,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536528407] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:09,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:09,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:22:09,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054599813] [2021-05-22 01:22:09,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:22:09,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:22:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:22:09,543 INFO L87 Difference]: Start difference. First operand 201 states and 379 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:11,265 INFO L93 Difference]: Finished difference Result 323 states and 617 transitions. [2021-05-22 01:22:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:11,266 INFO L225 Difference]: With dead ends: 323 [2021-05-22 01:22:11,266 INFO L226 Difference]: Without dead ends: 189 [2021-05-22 01:22:11,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1586.0ms TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-05-22 01:22:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-05-22 01:22:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.8404255319148937) internal successors, (346), 188 states have internal predecessors, (346), 0 states have call successors, (0), 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-05-22 01:22:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 346 transitions. [2021-05-22 01:22:11,269 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 346 transitions. Word has length 61 [2021-05-22 01:22:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:11,270 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 346 transitions. [2021-05-22 01:22:11,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 346 transitions. [2021-05-22 01:22:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:11,270 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:11,270 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:11,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-22 01:22:11,271 INFO L430 AbstractCegarLoop]: === Iteration 23 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 463712683, now seen corresponding path program 17 times [2021-05-22 01:22:11,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:11,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556599551] [2021-05-22 01:22:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:11,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:11,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556599551] [2021-05-22 01:22:11,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556599551] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:11,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:11,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:22:11,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055748625] [2021-05-22 01:22:11,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:22:11,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:22:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:22:11,606 INFO L87 Difference]: Start difference. First operand 189 states and 346 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:13,275 INFO L93 Difference]: Finished difference Result 319 states and 602 transitions. [2021-05-22 01:22:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:13,276 INFO L225 Difference]: With dead ends: 319 [2021-05-22 01:22:13,276 INFO L226 Difference]: Without dead ends: 165 [2021-05-22 01:22:13,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1529.5ms TimeCoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-22 01:22:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-22 01:22:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.8414634146341464) internal successors, (302), 164 states have internal predecessors, (302), 0 states have call successors, (0), 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-05-22 01:22:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 302 transitions. [2021-05-22 01:22:13,279 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 302 transitions. Word has length 61 [2021-05-22 01:22:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:13,279 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 302 transitions. [2021-05-22 01:22:13,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 302 transitions. [2021-05-22 01:22:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-22 01:22:13,280 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:22:13,280 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:22:13,280 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-22 01:22:13,280 INFO L430 AbstractCegarLoop]: === Iteration 24 === [barErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:22:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:22:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1536955807, now seen corresponding path program 18 times [2021-05-22 01:22:13,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:22:13,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039890369] [2021-05-22 01:22:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:22:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:22:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:22:13,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:22:13,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039890369] [2021-05-22 01:22:13,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039890369] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:22:13,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:22:13,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-22 01:22:13,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570995123] [2021-05-22 01:22:13,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-22 01:22:13,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:22:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-22 01:22:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-05-22 01:22:13,635 INFO L87 Difference]: Start difference. First operand 165 states and 302 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:22:15,249 INFO L93 Difference]: Finished difference Result 164 states and 301 transitions. [2021-05-22 01:22:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-22 01:22:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-05-22 01:22:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:22:15,250 INFO L225 Difference]: With dead ends: 164 [2021-05-22 01:22:15,250 INFO L226 Difference]: Without dead ends: 0 [2021-05-22 01:22:15,250 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1540.7ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-05-22 01:22:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-22 01:22:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-22 01:22:15,251 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-05-22 01:22:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-22 01:22:15,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2021-05-22 01:22:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:22:15,251 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-22 01:22:15,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-22 01:22:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-22 01:22:15,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-22 01:22:15,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-22 01:22:15,252 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-05-22 01:22:15,254 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-22 01:22:15,255 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-22 01:22:15,255 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-22 01:22:15,255 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-22 01:22:15,255 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-22 01:22:15,255 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-22 01:22:15,255 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-22 01:22:15,255 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-22 01:22:15,255 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-05-22 01:22:15,257 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 89 transitions, 206 flow [2021-05-22 01:22:15,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 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-05-22 01:22:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 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-05-22 01:22:15,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-22 01:22:15,269 INFO L315 ceAbstractionStarter]: Result for error location InUseError was SAFE (2/2) [2021-05-22 01:22:15,269 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-22 01:22:15,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.05 01:22:15 BasicIcfg [2021-05-22 01:22:15,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-22 01:22:15,272 INFO L168 Benchmark]: Toolchain (without parser) took 43574.47 ms. Allocated memory was 379.6 MB in the beginning and 549.5 MB in the end (delta: 169.9 MB). Free memory was 341.2 MB in the beginning and 261.9 MB in the end (delta: 79.3 MB). Peak memory consumption was 251.1 MB. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 379.6 MB. Free memory was 360.0 MB in the beginning and 359.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.65 ms. Allocated memory is still 379.6 MB. Free memory was 341.0 MB in the beginning and 361.3 MB in the end (delta: -20.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.63 ms. Allocated memory is still 379.6 MB. Free memory was 361.3 MB in the beginning and 360.4 MB in the end (delta: 969.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: Boogie Preprocessor took 17.08 ms. Allocated memory is still 379.6 MB. Free memory was 360.4 MB in the beginning and 358.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: RCFGBuilder took 472.67 ms. Allocated memory is still 379.6 MB. Free memory was 358.3 MB in the beginning and 335.2 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-05-22 01:22:15,272 INFO L168 Benchmark]: TraceAbstraction took 42833.73 ms. Allocated memory was 379.6 MB in the beginning and 549.5 MB in the end (delta: 169.9 MB). Free memory was 334.2 MB in the beginning and 261.9 MB in the end (delta: 72.2 MB). Peak memory consumption was 244.2 MB. Max. memory is 16.0 GB. [2021-05-22 01:22:15,273 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.12 ms. Allocated memory is still 379.6 MB. Free memory was 360.0 MB in the beginning and 359.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 208.65 ms. Allocated memory is still 379.6 MB. Free memory was 341.0 MB in the beginning and 361.3 MB in the end (delta: -20.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.63 ms. Allocated memory is still 379.6 MB. Free memory was 361.3 MB in the beginning and 360.4 MB in the end (delta: 969.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.08 ms. Allocated memory is still 379.6 MB. Free memory was 360.4 MB in the beginning and 358.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 472.67 ms. Allocated memory is still 379.6 MB. Free memory was 358.3 MB in the beginning and 335.2 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 42833.73 ms. Allocated memory was 379.6 MB in the beginning and 549.5 MB in the end (delta: 169.9 MB). Free memory was 334.2 MB in the beginning and 261.9 MB in the end (delta: 72.2 MB). Peak memory consumption was 244.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 42670.2ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 33.2ms, AutomataDifference: 33014.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1970 SDtfs, 7518 SDslu, 25357 SDs, 0 SdLazy, 21682 SolverSat, 1014 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8551.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 1182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9558 ImplicationChecksByTransitivity, 28864.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=0, InterpolantAutomatonStates: 777, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 205.6ms AutomataMinimizationTime, 24 MinimizatonAttempts, 565 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.2ms SsaConstructionTime, 312.5ms SatisfiabilityAnalysisTime, 8792.5ms InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 16146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 thread instance sufficiency with 1 thread instances CFG has 5 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1.7ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...