java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/relax-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:36,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:36,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:36,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:36,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:36,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:36,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:36,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:36,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:36,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:36,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:36,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:36,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:36,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:36,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:36,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:36,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:36,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:36,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:36,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:36,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:36,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:36,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:36,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:36,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:36,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:36,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:36,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:36,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:36,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:36,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:36,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:36,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:36,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:36,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:36,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:36,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:36,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:36,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:36,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:36,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:36,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:36,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:36,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:36,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:36,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:36,448 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:36,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:36,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:36,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:36,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:36,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:36,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:36,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:36,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:36,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:36,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:36,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:36,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:36,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:36,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:36,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:36,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:36,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:36,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:36,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:36,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:36,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:36,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:36,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:36,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:36,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:36,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:36,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:36,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:36,767 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:36,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2.i [2019-10-13 21:32:36,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ce7027e/a689b80bcb25464fad23493c0eb232a8/FLAGfbc98c067 [2019-10-13 21:32:37,388 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:37,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2.i [2019-10-13 21:32:37,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ce7027e/a689b80bcb25464fad23493c0eb232a8/FLAGfbc98c067 [2019-10-13 21:32:37,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ce7027e/a689b80bcb25464fad23493c0eb232a8 [2019-10-13 21:32:37,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:37,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:37,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:37,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:37,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:37,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:37" (1/1) ... [2019-10-13 21:32:37,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b29b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:37, skipping insertion in model container [2019-10-13 21:32:37,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:37" (1/1) ... [2019-10-13 21:32:37,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:37,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:38,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,319 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:38,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,462 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:38,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38 WrapperNode [2019-10-13 21:32:38,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:38,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:38,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:38,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:38,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:38,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:38,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (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 [2019-10-13 21:32:38,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 21:32:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 21:32:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2019-10-13 21:32:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 21:32:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:32:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:32:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:32:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:32:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:32:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:32:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:32:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:32:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:32:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:32:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:32:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:32:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:32:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:32:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:32:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:32:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:32:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:32:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:32:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:32:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:32:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:32:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:32:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:32:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:32:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:32:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:32:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:32:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:32:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:32:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:32:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:32:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:32:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:32:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:32:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:32:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:32:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:32:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:32:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:32:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:32:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:32:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:32:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:32:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:32:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:32:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:32:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:32:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:32:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:39,436 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:39,436 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:32:39,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39 BoogieIcfgContainer [2019-10-13 21:32:39,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:39,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:39,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:39,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:39,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:37" (1/3) ... [2019-10-13 21:32:39,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee39644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (2/3) ... [2019-10-13 21:32:39,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee39644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39" (3/3) ... [2019-10-13 21:32:39,455 INFO L109 eAbstractionObserver]: Analyzing ICFG relax-2.i [2019-10-13 21:32:39,466 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:39,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:39,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:39,507 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:39,507 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:39,507 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:39,507 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:39,508 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:39,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:39,508 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:39,508 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-10-13 21:32:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:32:39,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,536 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,538 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,544 INFO L82 PathProgramCache]: Analyzing trace with hash -79995857, now seen corresponding path program 1 times [2019-10-13 21:32:39,554 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834738094] [2019-10-13 21:32:39,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:39,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834738094] [2019-10-13 21:32:39,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:39,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:39,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325694122] [2019-10-13 21:32:39,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:39,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:39,823 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2019-10-13 21:32:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:39,864 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-10-13 21:32:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:39,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-13 21:32:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:39,877 INFO L225 Difference]: With dead ends: 61 [2019-10-13 21:32:39,878 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:32:39,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:32:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 21:32:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 21:32:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-10-13 21:32:39,925 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 17 [2019-10-13 21:32:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:39,925 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-10-13 21:32:39,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2019-10-13 21:32:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:32:39,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,927 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1718639790, now seen corresponding path program 1 times [2019-10-13 21:32:39,928 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064732337] [2019-10-13 21:32:39,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:40,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064732337] [2019-10-13 21:32:40,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:40,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:32:40,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555731794] [2019-10-13 21:32:40,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:32:40,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:32:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:32:40,097 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 6 states. [2019-10-13 21:32:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:40,223 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-10-13 21:32:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:32:40,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 21:32:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:40,227 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:32:40,228 INFO L226 Difference]: Without dead ends: 46 [2019-10-13 21:32:40,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:32:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-13 21:32:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-13 21:32:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:32:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2019-10-13 21:32:40,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2019-10-13 21:32:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:40,241 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-10-13 21:32:40,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:32:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2019-10-13 21:32:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:32:40,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:40,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:40,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash -912243692, now seen corresponding path program 1 times [2019-10-13 21:32:40,243 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:40,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215240078] [2019-10-13 21:32:40,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:40,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:40,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215240078] [2019-10-13 21:32:40,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619532903] [2019-10-13 21:32:40,608 INFO L94 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 [2019-10-13 21:32:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:40,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:32:40,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:40,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:32:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:40,948 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:41,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508561920] [2019-10-13 21:32:41,381 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:32:41,381 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:41,393 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:41,403 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:41,405 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:41,619 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:41,946 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:41,968 INFO L199 IcfgInterpreter]: Interpreting procedure is_relaxed_prefix with input of size 12 for LOIs [2019-10-13 21:32:42,008 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:42,014 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:42,015 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:42,015 INFO L193 IcfgInterpreter]: Reachable states at location L1123-3 satisfy 68#true [2019-10-13 21:32:42,015 INFO L193 IcfgInterpreter]: Reachable states at location L1092 satisfy 152#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (exists ((v_main_~j~0_BEFORE_CALL_4 Int)) (and (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod v_main_~j~0_BEFORE_CALL_4 4294967296)))) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length)) [2019-10-13 21:32:42,016 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 183#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:42,016 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixEXIT satisfy 179#(and (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~i~0) (<= |is_relaxed_prefix_#res| 1) (<= 0 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~i~0 0) (<= is_relaxed_prefix_~i~0 0) (<= 1 |is_relaxed_prefix_#res|)) [2019-10-13 21:32:42,016 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixENTRY satisfy 147#(exists ((v_main_~j~0_BEFORE_CALL_4 Int)) (and (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod v_main_~j~0_BEFORE_CALL_4 4294967296)))) [2019-10-13 21:32:42,017 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 143#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,017 INFO L193 IcfgInterpreter]: Reachable states at location L1097-3 satisfy 157#(and (<= 0 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= 0 is_relaxed_prefix_~shift~0) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~shift~0) (not (< (mod (+ is_relaxed_prefix_~a_length 1) 4294967296) (mod is_relaxed_prefix_~pat_length 4294967296))) (<= is_relaxed_prefix_~i~0 0) (exists ((v_main_~j~0_BEFORE_CALL_4 Int)) (and (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod v_main_~j~0_BEFORE_CALL_4 4294967296)))) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length)) [2019-10-13 21:32:42,017 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,017 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,018 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixFINAL satisfy 168#(and (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~i~0) (<= |is_relaxed_prefix_#res| 1) (<= 0 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~i~0 0) (<= is_relaxed_prefix_~i~0 0) (<= 1 |is_relaxed_prefix_#res|)) [2019-10-13 21:32:42,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 188#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,018 INFO L193 IcfgInterpreter]: Reachable states at location L7 satisfy 133#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:42,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:42,019 INFO L193 IcfgInterpreter]: Reachable states at location L1126-3 satisfy 73#(and (= main_~j~1 0) (<= main_~j~1 0) (not (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296))) (<= 0 main_~j~1)) [2019-10-13 21:32:42,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 128#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:42,019 INFO L193 IcfgInterpreter]: Reachable states at location L1133 satisfy 123#(and (= main_~j~1 0) (<= main_~j~1 0) (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296))) (<= 0 main_~j~1)) [2019-10-13 21:32:42,019 INFO L193 IcfgInterpreter]: Reachable states at location L1126-4 satisfy 78#(and (= main_~j~1 0) (<= main_~j~1 0) (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296))) (<= 0 main_~j~1)) [2019-10-13 21:32:42,020 INFO L193 IcfgInterpreter]: Reachable states at location L8 satisfy 138#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,020 INFO L193 IcfgInterpreter]: Reachable states at location L1131 satisfy 104#(and (= main_~j~1 0) (<= main_~j~1 0) (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= 1 |main_#t~ret14|) (not (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296))) (<= 0 main_~j~1) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:42,973 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:42,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 15] total 32 [2019-10-13 21:32:42,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48421166] [2019-10-13 21:32:42,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:32:42,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:32:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:32:42,979 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 32 states. [2019-10-13 21:32:44,826 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-13 21:32:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:50,376 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2019-10-13 21:32:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-13 21:32:50,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-10-13 21:32:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:50,380 INFO L225 Difference]: With dead ends: 160 [2019-10-13 21:32:50,380 INFO L226 Difference]: Without dead ends: 117 [2019-10-13 21:32:50,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=473, Invalid=3433, Unknown=0, NotChecked=0, Total=3906 [2019-10-13 21:32:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-13 21:32:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 63. [2019-10-13 21:32:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 21:32:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2019-10-13 21:32:50,413 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 19 [2019-10-13 21:32:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:50,413 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2019-10-13 21:32:50,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:32:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2019-10-13 21:32:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:32:50,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:50,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:50,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:50,622 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1553628473, now seen corresponding path program 1 times [2019-10-13 21:32:50,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:50,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116734655] [2019-10-13 21:32:50,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:50,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:50,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:50,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116734655] [2019-10-13 21:32:50,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:50,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:32:50,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18845488] [2019-10-13 21:32:50,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:32:50,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:32:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:32:50,715 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 6 states. [2019-10-13 21:32:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:50,814 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2019-10-13 21:32:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:32:50,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 21:32:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:50,817 INFO L225 Difference]: With dead ends: 81 [2019-10-13 21:32:50,817 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 21:32:50,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:32:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 21:32:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-10-13 21:32:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 21:32:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-10-13 21:32:50,832 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 19 [2019-10-13 21:32:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:50,832 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-10-13 21:32:50,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:32:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-10-13 21:32:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:32:50,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:50,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:50,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 782103735, now seen corresponding path program 1 times [2019-10-13 21:32:50,835 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:50,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155787511] [2019-10-13 21:32:50,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:50,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:50,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:50,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155787511] [2019-10-13 21:32:50,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:50,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:32:50,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674304978] [2019-10-13 21:32:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:32:50,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:32:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:32:50,976 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 8 states. [2019-10-13 21:32:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,205 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2019-10-13 21:32:51,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:32:51,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-13 21:32:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,211 INFO L225 Difference]: With dead ends: 82 [2019-10-13 21:32:51,211 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 21:32:51,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:32:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 21:32:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-13 21:32:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 21:32:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2019-10-13 21:32:51,225 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 20 [2019-10-13 21:32:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,225 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2019-10-13 21:32:51,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:32:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2019-10-13 21:32:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:32:51,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,227 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1211472267, now seen corresponding path program 1 times [2019-10-13 21:32:51,228 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802906741] [2019-10-13 21:32:51,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:51,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802906741] [2019-10-13 21:32:51,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044124871] [2019-10-13 21:32:51,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-10-13 21:32:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 21:32:51,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:51,867 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:52,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1205979378] [2019-10-13 21:32:52,211 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:32:52,212 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:52,212 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:52,212 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:52,213 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:52,247 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,550 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:52,569 INFO L199 IcfgInterpreter]: Interpreting procedure is_relaxed_prefix with input of size 10 for LOIs [2019-10-13 21:32:52,596 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,601 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,601 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,601 INFO L193 IcfgInterpreter]: Reachable states at location L1123-3 satisfy 68#true [2019-10-13 21:32:52,601 INFO L193 IcfgInterpreter]: Reachable states at location L1092 satisfy 185#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (exists ((v_main_~j~1_BEFORE_CALL_8 Int)) (and (<= 0 v_main_~j~1_BEFORE_CALL_8) (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod v_main_~j~1_BEFORE_CALL_8 4294967296)))) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length)) [2019-10-13 21:32:52,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 216#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:52,602 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixEXIT satisfy 212#(and (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~i~0) (<= |is_relaxed_prefix_#res| 1) (<= 0 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~i~0 0) (<= is_relaxed_prefix_~i~0 0) (<= 1 |is_relaxed_prefix_#res|)) [2019-10-13 21:32:52,602 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixENTRY satisfy 180#(exists ((v_main_~j~1_BEFORE_CALL_8 Int)) (and (<= 0 v_main_~j~1_BEFORE_CALL_8) (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod v_main_~j~1_BEFORE_CALL_8 4294967296)))) [2019-10-13 21:32:52,602 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 176#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,603 INFO L193 IcfgInterpreter]: Reachable states at location L1097-3 satisfy 190#(and (<= 0 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (exists ((v_main_~j~1_BEFORE_CALL_8 Int)) (and (<= 0 v_main_~j~1_BEFORE_CALL_8) (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod v_main_~j~1_BEFORE_CALL_8 4294967296)))) (= 0 is_relaxed_prefix_~shift~0) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~shift~0) (not (< (mod (+ is_relaxed_prefix_~a_length 1) 4294967296) (mod is_relaxed_prefix_~pat_length 4294967296))) (<= is_relaxed_prefix_~i~0 0) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length)) [2019-10-13 21:32:52,603 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,603 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,603 INFO L193 IcfgInterpreter]: Reachable states at location is_relaxed_prefixFINAL satisfy 201#(and (<= is_relaxed_prefix_~shift~0 0) (<= 0 is_relaxed_prefix_~i~0) (<= |is_relaxed_prefix_#res| 1) (<= 0 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~i~0 0) (<= is_relaxed_prefix_~i~0 0) (<= 1 |is_relaxed_prefix_#res|)) [2019-10-13 21:32:52,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 221#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,604 INFO L193 IcfgInterpreter]: Reachable states at location L7 satisfy 166#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:52,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,604 INFO L193 IcfgInterpreter]: Reachable states at location L1126-3 satisfy 106#(<= 0 main_~j~1) [2019-10-13 21:32:52,604 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 161#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:52,605 INFO L193 IcfgInterpreter]: Reachable states at location L1133 satisfy 156#(and (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= 0 main_~j~1)) [2019-10-13 21:32:52,605 INFO L193 IcfgInterpreter]: Reachable states at location L1126-4 satisfy 111#(and (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= 0 main_~j~1)) [2019-10-13 21:32:52,605 INFO L193 IcfgInterpreter]: Reachable states at location L8 satisfy 171#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:52,605 INFO L193 IcfgInterpreter]: Reachable states at location L1131 satisfy 137#(and (not (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= 1 |main_#t~ret14|) (<= 0 main_~j~1) (<= |main_#t~ret14| 1)) [2019-10-13 21:32:53,371 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:53,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9, 14] total 36 [2019-10-13 21:32:53,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726330490] [2019-10-13 21:32:53,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-13 21:32:53,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-13 21:32:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 21:32:53,375 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand 36 states. [2019-10-13 21:32:55,124 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2019-10-13 21:32:55,937 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-13 21:32:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:58,702 INFO L93 Difference]: Finished difference Result 156 states and 235 transitions. [2019-10-13 21:32:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-13 21:32:58,703 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 21 [2019-10-13 21:32:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:58,705 INFO L225 Difference]: With dead ends: 156 [2019-10-13 21:32:58,705 INFO L226 Difference]: Without dead ends: 125 [2019-10-13 21:32:58,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=561, Invalid=4409, Unknown=0, NotChecked=0, Total=4970 [2019-10-13 21:32:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-13 21:32:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 54. [2019-10-13 21:32:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:32:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2019-10-13 21:32:58,722 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 21 [2019-10-13 21:32:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:58,722 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2019-10-13 21:32:58,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-13 21:32:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2019-10-13 21:32:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:32:58,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:58,724 INFO L380 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] [2019-10-13 21:32:58,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:58,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -820718679, now seen corresponding path program 1 times [2019-10-13 21:32:58,936 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:58,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028251254] [2019-10-13 21:32:58,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:58,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:59,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028251254] [2019-10-13 21:32:59,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697605126] [2019-10-13 21:32:59,253 INFO L94 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 [2019-10-13 21:32:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:59,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 21:32:59,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:59,545 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:02,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335789806] [2019-10-13 21:33:02,411 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 21:33:02,411 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:02,412 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:02,412 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:02,412 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:02,442 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:02,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:02,845 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:33:02,852 INFO L168 Benchmark]: Toolchain (without parser) took 25094.26 ms. Allocated memory was 145.2 MB in the beginning and 353.4 MB in the end (delta: 208.1 MB). Free memory was 100.6 MB in the beginning and 140.4 MB in the end (delta: -39.8 MB). Peak memory consumption was 168.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,853 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 168.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,854 INFO L168 Benchmark]: Boogie Preprocessor took 62.36 ms. Allocated memory is still 202.9 MB. Free memory was 168.2 MB in the beginning and 165.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,855 INFO L168 Benchmark]: RCFGBuilder took 911.77 ms. Allocated memory is still 202.9 MB. Free memory was 165.6 MB in the beginning and 107.6 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,856 INFO L168 Benchmark]: TraceAbstraction took 23409.85 ms. Allocated memory was 202.9 MB in the beginning and 353.4 MB in the end (delta: 150.5 MB). Free memory was 107.6 MB in the beginning and 140.4 MB in the end (delta: -32.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:33:02,859 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.20 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 168.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.36 ms. Allocated memory is still 202.9 MB. Free memory was 168.2 MB in the beginning and 165.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 911.77 ms. Allocated memory is still 202.9 MB. Free memory was 165.6 MB in the beginning and 107.6 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23409.85 ms. Allocated memory was 202.9 MB in the beginning and 353.4 MB in the end (delta: 150.5 MB). Free memory was 107.6 MB in the beginning and 140.4 MB in the end (delta: -32.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...