/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 17:50:34,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 17:50:34,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 17:50:34,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 17:50:34,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 17:50:34,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 17:50:34,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 17:50:34,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 17:50:34,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 17:50:34,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 17:50:34,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 17:50:34,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 17:50:34,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 17:50:34,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 17:50:34,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 17:50:34,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 17:50:34,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 17:50:34,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 17:50:34,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 17:50:34,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 17:50:34,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 17:50:34,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 17:50:34,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 17:50:34,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 17:50:34,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 17:50:34,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 17:50:34,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 17:50:34,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 17:50:34,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 17:50:34,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 17:50:34,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 17:50:34,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 17:50:34,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 17:50:34,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 17:50:34,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 17:50:34,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 17:50:34,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 17:50:34,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 17:50:34,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 17:50:34,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 17:50:34,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 17:50:34,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 17:50:34,524 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 17:50:34,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 17:50:34,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 17:50:34,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 17:50:34,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 17:50:34,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 17:50:34,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 17:50:34,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 17:50:34,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:50:34,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 17:50:34,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 17:50:34,532 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 17:50:34,532 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 17:50:34,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 17:50:34,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 17:50:34,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 17:50:34,893 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 17:50:34,893 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 17:50:34,894 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 [2021-05-02 17:50:34,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929bd428b/142f5e9cb21a4e5788f8f29426539435/FLAG3bde914a2 [2021-05-02 17:50:35,474 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 17:50:35,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-05-02 17:50:35,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929bd428b/142f5e9cb21a4e5788f8f29426539435/FLAG3bde914a2 [2021-05-02 17:50:35,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929bd428b/142f5e9cb21a4e5788f8f29426539435 [2021-05-02 17:50:35,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 17:50:35,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 17:50:35,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 17:50:35,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 17:50:35,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 17:50:35,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:50:35" (1/1) ... [2021-05-02 17:50:35,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376aee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:35, skipping insertion in model container [2021-05-02 17:50:35,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:50:35" (1/1) ... [2021-05-02 17:50:35,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 17:50:35,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 17:50:36,094 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-05-02 17:50:36,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:50:36,169 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 17:50:36,191 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-05-02 17:50:36,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:50:36,222 INFO L208 MainTranslator]: Completed translation [2021-05-02 17:50:36,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36 WrapperNode [2021-05-02 17:50:36,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 17:50:36,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 17:50:36,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 17:50:36,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 17:50:36,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 17:50:36,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 17:50:36,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 17:50:36,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 17:50:36,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:50:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 17:50:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 17:50:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 17:50:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 17:50:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2021-05-02 17:50:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2021-05-02 17:50:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 17:50:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 17:50:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 17:50:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 17:50:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 17:50:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 17:50:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 17:50:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 17:50:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2021-05-02 17:50:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-05-02 17:50:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2021-05-02 17:50:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-05-02 17:50:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2021-05-02 17:50:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-05-02 17:50:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2021-05-02 17:50:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 17:50:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 17:50:36,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 17:50:36,884 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 17:50:36,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:50:36 BoogieIcfgContainer [2021-05-02 17:50:36,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 17:50:36,888 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 17:50:36,888 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 17:50:36,889 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 17:50:36,891 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:50:36" (1/1) ... [2021-05-02 17:50:36,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:50:36 BasicIcfg [2021-05-02 17:50:36,918 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 17:50:36,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 17:50:36,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 17:50:36,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 17:50:36,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 05:50:35" (1/4) ... [2021-05-02 17:50:36,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421159ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:50:36, skipping insertion in model container [2021-05-02 17:50:36,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:50:36" (2/4) ... [2021-05-02 17:50:36,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421159ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:50:36, skipping insertion in model container [2021-05-02 17:50:36,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:50:36" (3/4) ... [2021-05-02 17:50:36,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421159ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:50:36, skipping insertion in model container [2021-05-02 17:50:36,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:50:36" (4/4) ... [2021-05-02 17:50:36,929 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.iJordan [2021-05-02 17:50:36,934 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 17:50:36,940 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 17:50:36,956 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 17:50:36,984 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 17:50:36,984 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 17:50:36,984 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 17:50:36,984 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 17:50:36,984 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 17:50:36,985 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 17:50:36,985 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 17:50:36,985 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 17:50:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 17:50:37,016 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:37,017 INFO L523 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] [2021-05-02 17:50:37,017 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1482838745, now seen corresponding path program 1 times [2021-05-02 17:50:37,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:37,031 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135680651] [2021-05-02 17:50:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-02 17:50:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:37,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:37,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135680651] [2021-05-02 17:50:37,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135680651] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:37,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:37,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 17:50:37,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002038538] [2021-05-02 17:50:37,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 17:50:37,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 17:50:37,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 17:50:37,337 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:37,467 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2021-05-02 17:50:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 17:50:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-05-02 17:50:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:37,480 INFO L225 Difference]: With dead ends: 51 [2021-05-02 17:50:37,481 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 17:50:37,482 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 17:50:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 17:50:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 17:50:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2021-05-02 17:50:37,519 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2021-05-02 17:50:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:37,519 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2021-05-02 17:50:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2021-05-02 17:50:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 17:50:37,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:37,523 INFO L523 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] [2021-05-02 17:50:37,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 17:50:37,524 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1955249573, now seen corresponding path program 1 times [2021-05-02 17:50:37,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:37,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175320880] [2021-05-02 17:50:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 17:50:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:37,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:37,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175320880] [2021-05-02 17:50:37,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175320880] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:37,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:37,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 17:50:37,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490047832] [2021-05-02 17:50:37,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 17:50:37,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 17:50:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:50:37,640 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:37,767 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2021-05-02 17:50:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 17:50:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 17:50:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:37,769 INFO L225 Difference]: With dead ends: 44 [2021-05-02 17:50:37,769 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 17:50:37,769 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 17:50:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 17:50:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-05-02 17:50:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-05-02 17:50:37,775 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2021-05-02 17:50:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:37,775 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-05-02 17:50:37,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-05-02 17:50:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 17:50:37,776 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:37,776 INFO L523 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] [2021-05-02 17:50:37,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 17:50:37,777 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1743898660, now seen corresponding path program 1 times [2021-05-02 17:50:37,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:37,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880447542] [2021-05-02 17:50:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 17:50:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:37,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:37,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880447542] [2021-05-02 17:50:37,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880447542] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:37,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:37,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 17:50:37,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386512177] [2021-05-02 17:50:37,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 17:50:37,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 17:50:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:50:37,905 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:38,060 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2021-05-02 17:50:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 17:50:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 17:50:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:38,066 INFO L225 Difference]: With dead ends: 71 [2021-05-02 17:50:38,067 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 17:50:38,067 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 17:50:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 17:50:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2021-05-02 17:50:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2021-05-02 17:50:38,085 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2021-05-02 17:50:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:38,085 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2021-05-02 17:50:38,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2021-05-02 17:50:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 17:50:38,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:38,086 INFO L523 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] [2021-05-02 17:50:38,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 17:50:38,087 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash 883199996, now seen corresponding path program 1 times [2021-05-02 17:50:38,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:38,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642484328] [2021-05-02 17:50:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 17:50:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:38,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:38,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642484328] [2021-05-02 17:50:38,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642484328] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:38,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:38,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 17:50:38,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616153645] [2021-05-02 17:50:38,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 17:50:38,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 17:50:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 17:50:38,227 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:38,447 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2021-05-02 17:50:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 17:50:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 17:50:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:38,449 INFO L225 Difference]: With dead ends: 115 [2021-05-02 17:50:38,449 INFO L226 Difference]: Without dead ends: 90 [2021-05-02 17:50:38,449 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-05-02 17:50:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-02 17:50:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2021-05-02 17:50:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2021-05-02 17:50:38,455 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 33 [2021-05-02 17:50:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:38,455 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2021-05-02 17:50:38,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2021-05-02 17:50:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 17:50:38,457 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:38,457 INFO L523 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] [2021-05-02 17:50:38,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 17:50:38,457 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash -113872357, now seen corresponding path program 1 times [2021-05-02 17:50:38,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:38,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666554315] [2021-05-02 17:50:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 17:50:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:38,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:38,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666554315] [2021-05-02 17:50:38,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666554315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:38,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:38,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 17:50:38,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062962970] [2021-05-02 17:50:38,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 17:50:38,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 17:50:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-05-02 17:50:38,593 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:38,845 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2021-05-02 17:50:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 17:50:38,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 17:50:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:38,847 INFO L225 Difference]: With dead ends: 111 [2021-05-02 17:50:38,847 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 17:50:38,848 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 141.3ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:50:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 17:50:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2021-05-02 17:50:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-05-02 17:50:38,855 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 33 [2021-05-02 17:50:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:38,855 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-05-02 17:50:38,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-05-02 17:50:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 17:50:38,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:38,857 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:50:38,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 17:50:38,858 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1490560960, now seen corresponding path program 1 times [2021-05-02 17:50:38,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:38,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390311834] [2021-05-02 17:50:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 17:50:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:38,911 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:38,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390311834] [2021-05-02 17:50:38,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390311834] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:38,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:38,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 17:50:38,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305657691] [2021-05-02 17:50:38,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 17:50:38,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 17:50:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 17:50:38,914 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:38,997 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2021-05-02 17:50:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 17:50:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-05-02 17:50:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:38,999 INFO L225 Difference]: With dead ends: 99 [2021-05-02 17:50:39,000 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 17:50:39,000 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 17:50:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 17:50:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 17:50:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 88 states have internal predecessors, (111), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2021-05-02 17:50:39,006 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 35 [2021-05-02 17:50:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:39,006 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2021-05-02 17:50:39,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2021-05-02 17:50:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 17:50:39,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:39,007 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:50:39,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 17:50:39,008 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash 980026783, now seen corresponding path program 1 times [2021-05-02 17:50:39,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:39,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599851056] [2021-05-02 17:50:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 17:50:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:39,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:39,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599851056] [2021-05-02 17:50:39,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599851056] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:39,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:39,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 17:50:39,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114799016] [2021-05-02 17:50:39,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 17:50:39,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 17:50:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 17:50:39,082 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:39,225 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2021-05-02 17:50:39,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 17:50:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-05-02 17:50:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:39,247 INFO L225 Difference]: With dead ends: 120 [2021-05-02 17:50:39,247 INFO L226 Difference]: Without dead ends: 120 [2021-05-02 17:50:39,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 50.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 17:50:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-02 17:50:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2021-05-02 17:50:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-05-02 17:50:39,260 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 35 [2021-05-02 17:50:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:39,261 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-05-02 17:50:39,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-05-02 17:50:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 17:50:39,264 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:39,264 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:50:39,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 17:50:39,264 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1227057006, now seen corresponding path program 1 times [2021-05-02 17:50:39,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:39,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933375454] [2021-05-02 17:50:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-02 17:50:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-02 17:50:39,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:39,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933375454] [2021-05-02 17:50:39,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933375454] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:50:39,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:50:39,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 17:50:39,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183974820] [2021-05-02 17:50:39,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 17:50:39,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 17:50:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-05-02 17:50:39,412 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:39,659 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2021-05-02 17:50:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 17:50:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-05-02 17:50:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:39,662 INFO L225 Difference]: With dead ends: 130 [2021-05-02 17:50:39,662 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 17:50:39,663 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 110.9ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:50:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 17:50:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2021-05-02 17:50:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.25) internal successors, (115), 93 states have internal predecessors, (115), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2021-05-02 17:50:39,680 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 38 [2021-05-02 17:50:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:39,681 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2021-05-02 17:50:39,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 17:50:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2021-05-02 17:50:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 17:50:39,684 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:39,684 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 17:50:39,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 17:50:39,685 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1122955826, now seen corresponding path program 1 times [2021-05-02 17:50:39,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:39,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519203534] [2021-05-02 17:50:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 17:50:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:39,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:39,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519203534] [2021-05-02 17:50:39,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519203534] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:39,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400841045] [2021-05-02 17:50:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:50:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:39,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 17:50:39,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:50:39,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:39,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:40,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:40,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:40,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:40,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:40,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400841045] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:40,092 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:50:40,092 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-05-02 17:50:40,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976496437] [2021-05-02 17:50:40,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 17:50:40,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 17:50:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-05-02 17:50:40,093 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 17:50:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:40,347 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2021-05-02 17:50:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 17:50:40,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2021-05-02 17:50:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:40,349 INFO L225 Difference]: With dead ends: 188 [2021-05-02 17:50:40,349 INFO L226 Difference]: Without dead ends: 179 [2021-05-02 17:50:40,350 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-05-02 17:50:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-02 17:50:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 141. [2021-05-02 17:50:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.220472440944882) internal successors, (155), 128 states have internal predecessors, (155), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 17:50:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2021-05-02 17:50:40,359 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 40 [2021-05-02 17:50:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:40,359 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2021-05-02 17:50:40,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 17:50:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2021-05-02 17:50:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 17:50:40,360 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:40,361 INFO L523 BasicCegarLoop]: trace histogram [3, 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] [2021-05-02 17:50:40,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-05-02 17:50:40,585 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 598095488, now seen corresponding path program 2 times [2021-05-02 17:50:40,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:40,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956583576] [2021-05-02 17:50:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:40,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:40,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-02 17:50:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:40,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:40,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956583576] [2021-05-02 17:50:40,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956583576] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:40,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026858405] [2021-05-02 17:50:40,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:50:41,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 17:50:41,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:50:41,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 17:50:41,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:50:41,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:41,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026858405] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:41,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:50:41,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2021-05-02 17:50:41,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547118148] [2021-05-02 17:50:41,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 17:50:41,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 17:50:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-05-02 17:50:41,364 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:41,955 INFO L93 Difference]: Finished difference Result 221 states and 269 transitions. [2021-05-02 17:50:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 17:50:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2021-05-02 17:50:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:41,957 INFO L225 Difference]: With dead ends: 221 [2021-05-02 17:50:41,957 INFO L226 Difference]: Without dead ends: 194 [2021-05-02 17:50:41,958 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 438.9ms TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2021-05-02 17:50:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-05-02 17:50:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 133. [2021-05-02 17:50:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.256198347107438) internal successors, (152), 122 states have internal predecessors, (152), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2021-05-02 17:50:41,963 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2021-05-02 17:50:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:41,965 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2021-05-02 17:50:41,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2021-05-02 17:50:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 17:50:41,966 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:41,966 INFO L523 BasicCegarLoop]: trace histogram [3, 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] [2021-05-02 17:50:42,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 17:50:42,191 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 189271263, now seen corresponding path program 1 times [2021-05-02 17:50:42,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:42,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088493838] [2021-05-02 17:50:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:42,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:50:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:42,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-02 17:50:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:42,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:50:42,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088493838] [2021-05-02 17:50:42,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088493838] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:42,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803956232] [2021-05-02 17:50:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:50:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:50:42,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 17:50:42,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:50:42,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:50:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 17:50:42,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803956232] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:50:42,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:50:42,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-05-02 17:50:42,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944335584] [2021-05-02 17:50:42,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 17:50:42,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:50:42,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 17:50:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-02 17:50:42,743 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:50:43,219 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2021-05-02 17:50:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 17:50:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2021-05-02 17:50:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:50:43,222 INFO L225 Difference]: With dead ends: 215 [2021-05-02 17:50:43,222 INFO L226 Difference]: Without dead ends: 215 [2021-05-02 17:50:43,222 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 329.0ms TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2021-05-02 17:50:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-05-02 17:50:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2021-05-02 17:50:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.292857142857143) internal successors, (181), 141 states have internal predecessors, (181), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 17:50:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2021-05-02 17:50:43,229 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 45 [2021-05-02 17:50:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:50:43,229 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2021-05-02 17:50:43,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 17:50:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2021-05-02 17:50:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 17:50:43,230 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:50:43,230 INFO L523 BasicCegarLoop]: trace histogram [3, 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] [2021-05-02 17:50:43,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-05-02 17:50:43,437 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:50:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:50:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1607680096, now seen corresponding path program 1 times [2021-05-02 17:50:43,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:50:43,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795974616] [2021-05-02 17:50:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:50:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:50:43,460 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:50:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:50:43,473 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:50:43,507 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 17:50:43,508 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 17:50:43,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 17:50:43,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:50:43 BasicIcfg [2021-05-02 17:50:43,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 17:50:43,566 INFO L168 Benchmark]: Toolchain (without parser) took 7610.07 ms. Allocated memory was 184.5 MB in the beginning and 230.7 MB in the end (delta: 46.1 MB). Free memory was 148.4 MB in the beginning and 81.3 MB in the end (delta: 67.0 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,566 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 184.5 MB. Free memory is still 165.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 17:50:43,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.56 ms. Allocated memory is still 184.5 MB. Free memory was 148.2 MB in the beginning and 165.6 MB in the end (delta: -17.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,566 INFO L168 Benchmark]: Boogie Preprocessor took 51.24 ms. Allocated memory is still 184.5 MB. Free memory was 165.6 MB in the beginning and 163.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,567 INFO L168 Benchmark]: RCFGBuilder took 610.74 ms. Allocated memory is still 184.5 MB. Free memory was 163.5 MB in the beginning and 135.8 MB in the end (delta: 27.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,567 INFO L168 Benchmark]: IcfgTransformer took 29.76 ms. Allocated memory is still 184.5 MB. Free memory was 135.8 MB in the beginning and 133.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,567 INFO L168 Benchmark]: TraceAbstraction took 6645.05 ms. Allocated memory was 184.5 MB in the beginning and 230.7 MB in the end (delta: 46.1 MB). Free memory was 133.3 MB in the beginning and 81.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 99.4 MB. Max. memory is 8.0 GB. [2021-05-02 17:50:43,567 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.14 ms. Allocated memory is still 184.5 MB. Free memory is still 165.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 264.56 ms. Allocated memory is still 184.5 MB. Free memory was 148.2 MB in the beginning and 165.6 MB in the end (delta: -17.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.24 ms. Allocated memory is still 184.5 MB. Free memory was 165.6 MB in the beginning and 163.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 610.74 ms. Allocated memory is still 184.5 MB. Free memory was 163.5 MB in the beginning and 135.8 MB in the end (delta: 27.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. * IcfgTransformer took 29.76 ms. Allocated memory is still 184.5 MB. Free memory was 135.8 MB in the beginning and 133.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6645.05 ms. Allocated memory was 184.5 MB in the beginning and 230.7 MB in the end (delta: 46.1 MB). Free memory was 133.3 MB in the beginning and 81.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 99.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L85] char A [2 + 2 + 4 +1]; [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; [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++ [L64] str[i] [L65] case 0: VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=-1] [L80] EXPR str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=-1] [L80] COND TRUE str[i] != 0 [L63] i++ [L64] str[i] [L65] case 0: VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=54] [L80] EXPR str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=54] [L80] COND TRUE str[i] != 0 [L63] i++ [L64] str[i] [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] [L66] (str[start] == ' ') || (str[start] == '\t') [L66] EXPR str[start] [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]=-1, str[start]=-1] [L66] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [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]=-1] [L67] COND FALSE !(str[start] == '"') [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')) [L69] EXPR str[j] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') [L69] EXPR str[j] [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]=54, str[j]=54] [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]=54, str[j]=54] [L69] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L70] (0 < j) && (str[j] == '"') [L70] EXPR str[j] [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]=54] [L70] COND FALSE !((0 < j) && (str[j] == '"')) [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); [L72] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={52:55}, 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] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6527.2ms, OverallIterations: 12, TraceHistogramMax: 3, EmptinessCheckTime: 34.8ms, AutomataDifference: 2776.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 530 SDtfs, 1116 SDslu, 1712 SDs, 0 SdLazy, 2315 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1542.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1331.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 115.2ms AutomataMinimizationTime, 11 MinimizatonAttempts, 283 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 96.7ms SsaConstructionTime, 332.9ms SatisfiabilityAnalysisTime, 2015.7ms InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 1851 SizeOfPredicates, 7 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 2/42 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...