/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:35:39,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:35:39,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:35:39,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:35:39,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:35:39,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:35:39,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:35:39,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:35:39,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:35:39,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:35:39,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:35:39,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:35:39,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:35:39,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:35:39,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:35:39,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:35:39,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:35:39,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:35:39,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:35:39,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:35:39,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:35:39,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:35:39,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:35:39,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:35:39,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:35:39,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:35:39,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:35:39,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:35:39,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:35:39,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:35:39,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:35:39,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:35:39,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:35:39,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:35:39,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:35:39,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:35:39,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:35:39,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:35:39,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:35:39,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:35:39,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:35:39,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:35:39,877 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:35:39,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:35:39,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:35:39,879 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:35:39,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:35:39,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:35:39,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:35:39,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:35:39,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:35:39,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:35:39,881 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:35:39,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:35:39,881 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:35:39,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:35:39,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:35:39,882 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:35:39,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:35:39,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:35:39,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:35:39,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:35:39,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:35:39,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:35:39,884 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:35:40,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:35:40,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:35:40,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:35:40,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:35:40,302 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:35:40,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-07 06:35:40,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8098f4286/146dfa8364a0476a97154494477d75a1/FLAGf7522958d [2020-11-07 06:35:41,067 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:35:41,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-07 06:35:41,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8098f4286/146dfa8364a0476a97154494477d75a1/FLAGf7522958d [2020-11-07 06:35:41,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8098f4286/146dfa8364a0476a97154494477d75a1 [2020-11-07 06:35:41,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:35:41,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:35:41,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:35:41,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:35:41,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:35:41,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0e310e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41, skipping insertion in model container [2020-11-07 06:35:41,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:35:41,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:35:41,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:35:41,704 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:35:41,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:35:41,768 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:35:41,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41 WrapperNode [2020-11-07 06:35:41,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:35:41,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:35:41,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:35:41,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:35:41,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (1/1) ... [2020-11-07 06:35:41,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:35:41,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:35:41,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:35:41,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:35:41,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (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 [2020-11-07 06:35:41,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:35:41,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:35:41,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:35:41,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:35:41,901 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-11-07 06:35:41,901 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-11-07 06:35:41,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:35:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:35:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:35:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-11-07 06:35:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-11-07 06:35:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-11-07 06:35:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-11-07 06:35:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-11-07 06:35:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-11-07 06:35:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-11-07 06:35:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-11-07 06:35:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:35:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:35:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:35:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:35:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:35:42,532 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:35:42,533 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-07 06:35:42,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:35:42 BoogieIcfgContainer [2020-11-07 06:35:42,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:35:42,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:35:42,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:35:42,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:35:42,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:35:41" (1/3) ... [2020-11-07 06:35:42,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb5b038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:35:42, skipping insertion in model container [2020-11-07 06:35:42,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:41" (2/3) ... [2020-11-07 06:35:42,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb5b038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:35:42, skipping insertion in model container [2020-11-07 06:35:42,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:35:42" (3/3) ... [2020-11-07 06:35:42,547 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-07 06:35:42,566 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:35:42,571 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:35:42,586 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:35:42,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:35:42,616 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:35:42,616 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:35:42,616 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:35:42,617 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:35:42,617 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:35:42,617 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:35:42,617 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:35:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2020-11-07 06:35:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 06:35:42,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:42,653 INFO L422 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] [2020-11-07 06:35:42,653 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1346984002, now seen corresponding path program 1 times [2020-11-07 06:35:42,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:42,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128856218] [2020-11-07 06:35:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:42,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:42,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:35:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:42,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128856218] [2020-11-07 06:35:42,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:42,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:35:42,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741995085] [2020-11-07 06:35:42,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:35:42,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:35:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:35:43,010 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 3 states. [2020-11-07 06:35:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:43,389 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2020-11-07 06:35:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:35:43,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-07 06:35:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:43,401 INFO L225 Difference]: With dead ends: 239 [2020-11-07 06:35:43,401 INFO L226 Difference]: Without dead ends: 108 [2020-11-07 06:35:43,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:35:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-07 06:35:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-11-07 06:35:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-07 06:35:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-11-07 06:35:43,468 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 54 [2020-11-07 06:35:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:43,470 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-11-07 06:35:43,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:35:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-11-07 06:35:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 06:35:43,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:43,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:43,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:35:43,477 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash 746606165, now seen corresponding path program 1 times [2020-11-07 06:35:43,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:43,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770889708] [2020-11-07 06:35:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:43,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:43,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:35:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:43,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770889708] [2020-11-07 06:35:43,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:43,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:35:43,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598673665] [2020-11-07 06:35:43,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:35:43,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:35:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:43,633 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 4 states. [2020-11-07 06:35:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:43,853 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2020-11-07 06:35:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:35:43,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 06:35:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:43,856 INFO L225 Difference]: With dead ends: 197 [2020-11-07 06:35:43,856 INFO L226 Difference]: Without dead ends: 109 [2020-11-07 06:35:43,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-07 06:35:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-11-07 06:35:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 06:35:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2020-11-07 06:35:43,873 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 66 [2020-11-07 06:35:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:43,874 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2020-11-07 06:35:43,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:35:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-11-07 06:35:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 06:35:43,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:43,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:43,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:35:43,877 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1799427698, now seen corresponding path program 1 times [2020-11-07 06:35:43,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:43,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139844003] [2020-11-07 06:35:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:44,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:44,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:35:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:44,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139844003] [2020-11-07 06:35:44,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:44,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:35:44,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393320297] [2020-11-07 06:35:44,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:35:44,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:35:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:44,173 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2020-11-07 06:35:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:44,748 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2020-11-07 06:35:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:35:44,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2020-11-07 06:35:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:44,754 INFO L225 Difference]: With dead ends: 216 [2020-11-07 06:35:44,754 INFO L226 Difference]: Without dead ends: 212 [2020-11-07 06:35:44,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:35:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-11-07 06:35:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 169. [2020-11-07 06:35:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-11-07 06:35:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2020-11-07 06:35:44,783 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 68 [2020-11-07 06:35:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:44,784 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2020-11-07 06:35:44,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:35:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2020-11-07 06:35:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 06:35:44,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:44,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:44,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:35:44,788 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1878630598, now seen corresponding path program 1 times [2020-11-07 06:35:44,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:44,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267367898] [2020-11-07 06:35:44,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:45,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:45,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:35:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:45,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267367898] [2020-11-07 06:35:45,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:45,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 06:35:45,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083782866] [2020-11-07 06:35:45,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:35:45,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:35:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:45,082 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 12 states. [2020-11-07 06:35:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:46,172 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2020-11-07 06:35:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:35:46,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2020-11-07 06:35:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:46,178 INFO L225 Difference]: With dead ends: 456 [2020-11-07 06:35:46,178 INFO L226 Difference]: Without dead ends: 364 [2020-11-07 06:35:46,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:35:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-07 06:35:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 209. [2020-11-07 06:35:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-11-07 06:35:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2020-11-07 06:35:46,211 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 71 [2020-11-07 06:35:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:46,212 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2020-11-07 06:35:46,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:35:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2020-11-07 06:35:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 06:35:46,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:46,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:46,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:35:46,215 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:46,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1354483306, now seen corresponding path program 1 times [2020-11-07 06:35:46,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:46,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508678224] [2020-11-07 06:35:46,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:35:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:46,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508678224] [2020-11-07 06:35:46,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:46,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:35:46,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881760172] [2020-11-07 06:35:46,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:35:46,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:35:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:46,292 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand 4 states. [2020-11-07 06:35:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:46,553 INFO L93 Difference]: Finished difference Result 301 states and 340 transitions. [2020-11-07 06:35:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:35:46,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 06:35:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:46,556 INFO L225 Difference]: With dead ends: 301 [2020-11-07 06:35:46,557 INFO L226 Difference]: Without dead ends: 211 [2020-11-07 06:35:46,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-07 06:35:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-11-07 06:35:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-07 06:35:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 238 transitions. [2020-11-07 06:35:46,596 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 238 transitions. Word has length 71 [2020-11-07 06:35:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:46,596 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 238 transitions. [2020-11-07 06:35:46,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:35:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 238 transitions. [2020-11-07 06:35:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 06:35:46,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:46,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:46,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:35:46,600 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash -644302664, now seen corresponding path program 1 times [2020-11-07 06:35:46,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:46,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254183561] [2020-11-07 06:35:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:35:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:46,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254183561] [2020-11-07 06:35:46,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:46,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 06:35:46,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018887974] [2020-11-07 06:35:46,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:35:46,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:35:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:35:46,729 INFO L87 Difference]: Start difference. First operand 211 states and 238 transitions. Second operand 5 states. [2020-11-07 06:35:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:47,052 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2020-11-07 06:35:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:35:47,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-11-07 06:35:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:47,056 INFO L225 Difference]: With dead ends: 324 [2020-11-07 06:35:47,056 INFO L226 Difference]: Without dead ends: 225 [2020-11-07 06:35:47,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:35:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-07 06:35:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2020-11-07 06:35:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 06:35:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2020-11-07 06:35:47,079 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 72 [2020-11-07 06:35:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:47,079 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2020-11-07 06:35:47,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:35:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2020-11-07 06:35:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 06:35:47,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:47,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:47,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:35:47,081 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1665835257, now seen corresponding path program 1 times [2020-11-07 06:35:47,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:47,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824465678] [2020-11-07 06:35:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-07 06:35:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:47,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824465678] [2020-11-07 06:35:47,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:47,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:35:47,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696515586] [2020-11-07 06:35:47,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:35:47,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:35:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:35:47,164 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand 6 states. [2020-11-07 06:35:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:47,570 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2020-11-07 06:35:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:35:47,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2020-11-07 06:35:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:47,575 INFO L225 Difference]: With dead ends: 390 [2020-11-07 06:35:47,575 INFO L226 Difference]: Without dead ends: 276 [2020-11-07 06:35:47,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-07 06:35:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 219. [2020-11-07 06:35:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-11-07 06:35:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2020-11-07 06:35:47,599 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 73 [2020-11-07 06:35:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:47,600 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2020-11-07 06:35:47,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:35:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2020-11-07 06:35:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 06:35:47,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:47,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:47,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:35:47,602 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash -14206149, now seen corresponding path program 1 times [2020-11-07 06:35:47,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:47,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624640758] [2020-11-07 06:35:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-07 06:35:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:47,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624640758] [2020-11-07 06:35:47,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:47,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:35:47,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205461647] [2020-11-07 06:35:47,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:35:47,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:47,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:35:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:35:47,715 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand 6 states. [2020-11-07 06:35:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:48,171 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2020-11-07 06:35:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:35:48,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-07 06:35:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:48,175 INFO L225 Difference]: With dead ends: 362 [2020-11-07 06:35:48,175 INFO L226 Difference]: Without dead ends: 263 [2020-11-07 06:35:48,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:35:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-07 06:35:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 219. [2020-11-07 06:35:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-11-07 06:35:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2020-11-07 06:35:48,201 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 74 [2020-11-07 06:35:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:48,201 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2020-11-07 06:35:48,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:35:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2020-11-07 06:35:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 06:35:48,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:48,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:48,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:35:48,212 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1638680456, now seen corresponding path program 1 times [2020-11-07 06:35:48,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:48,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [971163982] [2020-11-07 06:35:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:48,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:48,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:35:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:48,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [971163982] [2020-11-07 06:35:48,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:48,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:35:48,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302478338] [2020-11-07 06:35:48,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:35:48,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:35:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:48,361 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand 8 states. [2020-11-07 06:35:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:48,909 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2020-11-07 06:35:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:35:48,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-11-07 06:35:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:48,918 INFO L225 Difference]: With dead ends: 464 [2020-11-07 06:35:48,919 INFO L226 Difference]: Without dead ends: 305 [2020-11-07 06:35:48,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:35:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-07 06:35:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 226. [2020-11-07 06:35:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-11-07 06:35:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2020-11-07 06:35:48,955 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 76 [2020-11-07 06:35:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:48,955 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2020-11-07 06:35:48,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:35:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2020-11-07 06:35:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:35:48,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:48,960 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:48,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:35:48,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1528930525, now seen corresponding path program 1 times [2020-11-07 06:35:48,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:48,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [411490058] [2020-11-07 06:35:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:49,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:49,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:35:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:49,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [411490058] [2020-11-07 06:35:49,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:49,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:35:49,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996094116] [2020-11-07 06:35:49,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:35:49,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:35:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:35:49,162 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 10 states. [2020-11-07 06:35:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:50,014 INFO L93 Difference]: Finished difference Result 461 states and 506 transitions. [2020-11-07 06:35:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:35:50,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-07 06:35:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:50,018 INFO L225 Difference]: With dead ends: 461 [2020-11-07 06:35:50,018 INFO L226 Difference]: Without dead ends: 347 [2020-11-07 06:35:50,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:35:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-11-07 06:35:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 282. [2020-11-07 06:35:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-07 06:35:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 311 transitions. [2020-11-07 06:35:50,051 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 311 transitions. Word has length 78 [2020-11-07 06:35:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:50,051 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 311 transitions. [2020-11-07 06:35:50,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:35:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 311 transitions. [2020-11-07 06:35:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 06:35:50,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:50,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:50,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:35:50,054 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash 911510761, now seen corresponding path program 1 times [2020-11-07 06:35:50,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:50,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72365790] [2020-11-07 06:35:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:50,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:50,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:35:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:50,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72365790] [2020-11-07 06:35:50,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:50,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:35:50,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868819284] [2020-11-07 06:35:50,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:35:50,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:35:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:35:50,267 INFO L87 Difference]: Start difference. First operand 282 states and 311 transitions. Second operand 14 states. [2020-11-07 06:35:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:51,250 INFO L93 Difference]: Finished difference Result 460 states and 502 transitions. [2020-11-07 06:35:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 06:35:51,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-11-07 06:35:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:51,253 INFO L225 Difference]: With dead ends: 460 [2020-11-07 06:35:51,253 INFO L226 Difference]: Without dead ends: 338 [2020-11-07 06:35:51,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:35:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-11-07 06:35:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 276. [2020-11-07 06:35:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-11-07 06:35:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2020-11-07 06:35:51,299 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 81 [2020-11-07 06:35:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:51,300 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2020-11-07 06:35:51,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:35:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2020-11-07 06:35:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 06:35:51,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:51,303 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:51,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:35:51,303 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash -462249594, now seen corresponding path program 1 times [2020-11-07 06:35:51,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:51,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610575889] [2020-11-07 06:35:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:51,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:51,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-07 06:35:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 06:35:51,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610575889] [2020-11-07 06:35:51,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:51,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:35:51,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385949813] [2020-11-07 06:35:51,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:35:51,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:35:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:35:51,463 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand 10 states. [2020-11-07 06:35:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:52,182 INFO L93 Difference]: Finished difference Result 453 states and 498 transitions. [2020-11-07 06:35:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:35:52,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-11-07 06:35:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:52,186 INFO L225 Difference]: With dead ends: 453 [2020-11-07 06:35:52,186 INFO L226 Difference]: Without dead ends: 343 [2020-11-07 06:35:52,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:35:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-11-07 06:35:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2020-11-07 06:35:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-07 06:35:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2020-11-07 06:35:52,217 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 82 [2020-11-07 06:35:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:52,217 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2020-11-07 06:35:52,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:35:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2020-11-07 06:35:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 06:35:52,219 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:52,219 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:52,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:35:52,219 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1324418476, now seen corresponding path program 1 times [2020-11-07 06:35:52,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:52,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371802084] [2020-11-07 06:35:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:52,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:52,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:35:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:52,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371802084] [2020-11-07 06:35:52,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:52,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:35:52,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270073948] [2020-11-07 06:35:52,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:35:52,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:52,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:35:52,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:35:52,348 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand 10 states. [2020-11-07 06:35:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:53,011 INFO L93 Difference]: Finished difference Result 631 states and 698 transitions. [2020-11-07 06:35:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:35:53,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2020-11-07 06:35:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:53,017 INFO L225 Difference]: With dead ends: 631 [2020-11-07 06:35:53,017 INFO L226 Difference]: Without dead ends: 470 [2020-11-07 06:35:53,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:35:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-11-07 06:35:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 391. [2020-11-07 06:35:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-11-07 06:35:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 432 transitions. [2020-11-07 06:35:53,070 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 432 transitions. Word has length 87 [2020-11-07 06:35:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:53,070 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 432 transitions. [2020-11-07 06:35:53,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:35:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 432 transitions. [2020-11-07 06:35:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 06:35:53,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:53,073 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:53,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:35:53,073 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2103361900, now seen corresponding path program 2 times [2020-11-07 06:35:53,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:53,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682654487] [2020-11-07 06:35:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:53,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:53,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:35:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:53,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682654487] [2020-11-07 06:35:53,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:53,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:35:53,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934161289] [2020-11-07 06:35:53,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:35:53,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:35:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:53,269 INFO L87 Difference]: Start difference. First operand 391 states and 432 transitions. Second operand 12 states. [2020-11-07 06:35:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:54,243 INFO L93 Difference]: Finished difference Result 734 states and 809 transitions. [2020-11-07 06:35:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:35:54,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2020-11-07 06:35:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:54,247 INFO L225 Difference]: With dead ends: 734 [2020-11-07 06:35:54,248 INFO L226 Difference]: Without dead ends: 563 [2020-11-07 06:35:54,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:35:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-11-07 06:35:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 390. [2020-11-07 06:35:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-11-07 06:35:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 430 transitions. [2020-11-07 06:35:54,289 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 430 transitions. Word has length 88 [2020-11-07 06:35:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:54,289 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 430 transitions. [2020-11-07 06:35:54,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:35:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 430 transitions. [2020-11-07 06:35:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-07 06:35:54,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:54,291 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:54,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:35:54,292 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash -823874600, now seen corresponding path program 2 times [2020-11-07 06:35:54,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:54,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383147083] [2020-11-07 06:35:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:54,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:54,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:35:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:54,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383147083] [2020-11-07 06:35:54,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:54,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:35:54,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555751047] [2020-11-07 06:35:54,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:35:54,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:54,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:35:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:35:54,591 INFO L87 Difference]: Start difference. First operand 390 states and 430 transitions. Second operand 16 states. [2020-11-07 06:35:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:55,623 INFO L93 Difference]: Finished difference Result 575 states and 630 transitions. [2020-11-07 06:35:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:35:55,624 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2020-11-07 06:35:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:55,627 INFO L225 Difference]: With dead ends: 575 [2020-11-07 06:35:55,627 INFO L226 Difference]: Without dead ends: 380 [2020-11-07 06:35:55,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:35:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-11-07 06:35:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 339. [2020-11-07 06:35:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-11-07 06:35:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 372 transitions. [2020-11-07 06:35:55,662 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 372 transitions. Word has length 91 [2020-11-07 06:35:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:55,662 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 372 transitions. [2020-11-07 06:35:55,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:35:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 372 transitions. [2020-11-07 06:35:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 06:35:55,664 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:55,664 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:55,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:35:55,665 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 498819125, now seen corresponding path program 1 times [2020-11-07 06:35:55,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:55,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096667945] [2020-11-07 06:35:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:55,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:55,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:35:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 06:35:55,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096667945] [2020-11-07 06:35:55,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:55,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:35:55,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189708061] [2020-11-07 06:35:55,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:35:55,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:35:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:55,872 INFO L87 Difference]: Start difference. First operand 339 states and 372 transitions. Second operand 12 states. [2020-11-07 06:35:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:56,877 INFO L93 Difference]: Finished difference Result 613 states and 673 transitions. [2020-11-07 06:35:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:35:56,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-11-07 06:35:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:56,881 INFO L225 Difference]: With dead ends: 613 [2020-11-07 06:35:56,881 INFO L226 Difference]: Without dead ends: 491 [2020-11-07 06:35:56,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:35:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-11-07 06:35:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2020-11-07 06:35:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-11-07 06:35:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 406 transitions. [2020-11-07 06:35:56,915 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 406 transitions. Word has length 92 [2020-11-07 06:35:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:56,915 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 406 transitions. [2020-11-07 06:35:56,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:35:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 406 transitions. [2020-11-07 06:35:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-07 06:35:56,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:56,917 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:56,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:35:56,918 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 151465976, now seen corresponding path program 2 times [2020-11-07 06:35:56,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:56,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627947306] [2020-11-07 06:35:56,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:35:56,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:35:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:35:56,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:35:56,992 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:35:56,993 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:35:56,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:35:57,042 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,045 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,047 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,048 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,049 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,049 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,050 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,051 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,051 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,052 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,053 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,053 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,054 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,054 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,056 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,057 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,057 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,058 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,058 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,059 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,059 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,060 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-11-07 06:35:57,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:35:57 BoogieIcfgContainer [2020-11-07 06:35:57,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:35:57,084 INFO L168 Benchmark]: Toolchain (without parser) took 15645.00 ms. Allocated memory was 125.8 MB in the beginning and 287.3 MB in the end (delta: 161.5 MB). Free memory was 102.3 MB in the beginning and 135.0 MB in the end (delta: -32.7 MB). Peak memory consumption was 129.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:57,085 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 125.8 MB. Free memory is still 87.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:35:57,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.51 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 90.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:57,088 INFO L168 Benchmark]: Boogie Preprocessor took 54.27 ms. Allocated memory is still 125.8 MB. Free memory was 90.1 MB in the beginning and 88.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:57,089 INFO L168 Benchmark]: RCFGBuilder took 709.80 ms. Allocated memory was 125.8 MB in the beginning and 165.7 MB in the end (delta: 39.8 MB). Free memory was 88.1 MB in the beginning and 130.4 MB in the end (delta: -42.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:57,090 INFO L168 Benchmark]: TraceAbstraction took 14539.54 ms. Allocated memory was 165.7 MB in the beginning and 287.3 MB in the end (delta: 121.6 MB). Free memory was 129.8 MB in the beginning and 135.0 MB in the end (delta: -5.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:57,098 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.25 ms. Allocated memory is still 125.8 MB. Free memory is still 87.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 321.51 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 90.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.27 ms. Allocated memory is still 125.8 MB. Free memory was 90.1 MB in the beginning and 88.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 709.80 ms. Allocated memory was 125.8 MB in the beginning and 165.7 MB in the end (delta: 39.8 MB). Free memory was 88.1 MB in the beginning and 130.4 MB in the end (delta: -42.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14539.54 ms. Allocated memory was 165.7 MB in the beginning and 287.3 MB in the end (delta: 121.6 MB). Free memory was 129.8 MB in the beginning and 135.0 MB in the end (delta: -5.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch7 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] char A [2 + 2 + 4 +1]; VAL [A={6:0}] [L86] A[2 + 2 + 4] = 0 VAL [A={6:0}] [L87] CALL parse_expression_list (A) VAL [str={6:0}] [L59] int start=0, i=-1, j=-1; VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}] [L60] char str2[2]; VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L61] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L63] i++ VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L65] case 0: VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L80] EXPR str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L80] COND TRUE str[i] != 0 VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=58] [L63] i++ VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L65] case 0: VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L80] EXPR str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L80] COND TRUE str[i] != 0 VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=52] [L63] i++ VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L64] str[i] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L65] case 0: VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L66] EXPR str[start] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L66] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L66] EXPR str[start] VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L66] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L66] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58, str[start]=58] [L67] EXPR str[start] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L67] COND FALSE !(str[start] == '"') VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=58] [L68] j = i-1 VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L69] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L69] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L69] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52, str[j]=52] [L70] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L70] EXPR str[j] VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L70] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L70] COND FALSE !((0 < j) && (str[j] == '"')) VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=52] [L71] COND TRUE start<=j VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L72] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={6:0}] [L41] return strncpy(dest,src,n); VAL [\old(n)=2, \result={55:54}, dest={3:0}, dest={3:0}, n=2, src={6:0}, src={6:0}, strncpy(dest,src,n)={55:54}] [L72] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={55:54}, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L73] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "verisec_OpenSER_cases1_stripFullBoth_arr.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 133 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2186 SDtfs, 2614 SDslu, 8943 SDs, 0 SdLazy, 5597 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 993 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1322 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1208 ConstructedInterpolants, 0 QuantifiedInterpolants, 258452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 22/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...