/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/array-tiling/rew.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 14:38:50,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 14:38:50,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 14:38:50,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 14:38:50,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 14:38:50,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 14:38:50,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 14:38:50,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 14:38:50,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 14:38:50,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 14:38:50,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 14:38:50,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 14:38:50,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 14:38:50,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 14:38:50,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 14:38:50,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 14:38:50,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 14:38:50,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 14:38:50,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 14:38:50,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 14:38:50,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 14:38:50,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 14:38:50,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 14:38:50,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 14:38:50,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 14:38:50,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 14:38:50,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 14:38:50,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 14:38:50,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 14:38:50,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 14:38:50,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 14:38:50,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 14:38:50,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 14:38:50,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 14:38:50,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 14:38:50,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 14:38:50,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 14:38:50,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 14:38:50,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 14:38:50,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 14:38:50,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 14:38:50,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 14:38:50,705 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 14:38:50,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 14:38:50,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 14:38:50,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 14:38:50,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 14:38:50,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 14:38:50,707 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 14:38:50,707 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 14:38:50,707 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 14:38:50,707 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 14:38:50,708 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 14:38:50,708 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 14:38:50,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 14:38:50,709 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 14:38:50,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 14:38:50,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 14:38:50,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 14:38:50,711 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 14:38:50,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 14:38:50,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 14:38:50,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 14:38:50,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 14:38:50,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 14:38:50,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 14:38:50,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 14:38:50,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 14:38:50,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 14:38:50,995 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 14:38:50,996 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 14:38:50,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/rew.c [2023-04-02 14:38:52,125 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 14:38:52,330 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 14:38:52,331 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rew.c [2023-04-02 14:38:52,335 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f385401c6/1470540be0f04923a5e684c77359f31f/FLAG5c478b31e [2023-04-02 14:38:52,743 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f385401c6/1470540be0f04923a5e684c77359f31f [2023-04-02 14:38:52,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 14:38:52,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 14:38:52,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 14:38:52,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 14:38:52,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 14:38:52,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f26c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52, skipping insertion in model container [2023-04-02 14:38:52,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 14:38:52,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 14:38:52,909 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rew.c[394,407] [2023-04-02 14:38:52,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 14:38:52,936 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 14:38:52,947 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rew.c[394,407] [2023-04-02 14:38:52,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 14:38:52,970 INFO L208 MainTranslator]: Completed translation [2023-04-02 14:38:52,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52 WrapperNode [2023-04-02 14:38:52,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 14:38:52,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 14:38:52,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 14:38:52,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 14:38:52,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:52,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:53,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:53,002 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:53,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:53,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 14:38:53,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 14:38:53,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 14:38:53,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 14:38:53,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (1/1) ... [2023-04-02 14:38:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 14:38:53,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:38:53,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 14:38:53,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 14:38:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 14:38:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 14:38:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 14:38:53,131 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 14:38:53,132 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 14:38:53,251 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 14:38:53,288 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 14:38:53,289 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-02 14:38:53,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:38:53 BoogieIcfgContainer [2023-04-02 14:38:53,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 14:38:53,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 14:38:53,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 14:38:53,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 14:38:53,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 02:38:52" (1/3) ... [2023-04-02 14:38:53,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac875f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:38:53, skipping insertion in model container [2023-04-02 14:38:53,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:38:52" (2/3) ... [2023-04-02 14:38:53,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac875f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:38:53, skipping insertion in model container [2023-04-02 14:38:53,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:38:53" (3/3) ... [2023-04-02 14:38:53,299 INFO L112 eAbstractionObserver]: Analyzing ICFG rew.c [2023-04-02 14:38:53,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 14:38:53,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 14:38:53,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 14:38:53,369 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73229406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 14:38:53,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 14:38:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 14:38:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 14:38:53,381 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:38:53,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:38:53,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:38:53,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:38:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1538200716, now seen corresponding path program 1 times [2023-04-02 14:38:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:38:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427513213] [2023-04-02 14:38:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:38:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:53,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:38:53,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427513213] [2023-04-02 14:38:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427513213] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 14:38:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 14:38:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 14:38:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020508875] [2023-04-02 14:38:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 14:38:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 14:38:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:38:53,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 14:38:53,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 14:38:53,747 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:38:53,818 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-04-02 14:38:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 14:38:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 14:38:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:38:53,826 INFO L225 Difference]: With dead ends: 34 [2023-04-02 14:38:53,826 INFO L226 Difference]: Without dead ends: 17 [2023-04-02 14:38:53,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 14:38:53,831 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:38:53,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 14:38:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-04-02 14:38:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-04-02 14:38:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 14:38:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-04-02 14:38:53,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2023-04-02 14:38:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:38:53,868 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-04-02 14:38:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-04-02 14:38:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 14:38:53,870 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:38:53,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:38:53,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 14:38:53,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:38:53,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:38:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -866847342, now seen corresponding path program 1 times [2023-04-02 14:38:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:38:53,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918816574] [2023-04-02 14:38:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:38:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:54,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:38:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918816574] [2023-04-02 14:38:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918816574] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:38:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595395549] [2023-04-02 14:38:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:54,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:38:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:38:54,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:38:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 14:38:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:54,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 14:38:54,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:38:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:54,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:38:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595395549] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:38:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650919604] [2023-04-02 14:38:54,268 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-04-02 14:38:54,269 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:38:54,272 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:38:54,279 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:38:54,280 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:38:54,440 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:38:54,705 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 39 for LOIs [2023-04-02 14:38:54,741 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:38:54,757 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:38:55,233 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_1 1) |#StackHeapBarrier|) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) 0) 2))) (<= 2 ~SIZE~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:38:55,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:38:55,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:38:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-04-02 14:38:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727317871] [2023-04-02 14:38:55,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:38:55,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 14:38:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:38:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 14:38:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-04-02 14:38:55,237 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:38:55,276 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-04-02 14:38:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 14:38:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-04-02 14:38:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:38:55,278 INFO L225 Difference]: With dead ends: 27 [2023-04-02 14:38:55,278 INFO L226 Difference]: Without dead ends: 18 [2023-04-02 14:38:55,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-04-02 14:38:55,282 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:38:55,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 14:38:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-04-02 14:38:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-04-02 14:38:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 14:38:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-04-02 14:38:55,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2023-04-02 14:38:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:38:55,290 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-04-02 14:38:55,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-04-02 14:38:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 14:38:55,292 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:38:55,292 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:38:55,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 14:38:55,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:38:55,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:38:55,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:38:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1529729228, now seen corresponding path program 2 times [2023-04-02 14:38:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:38:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122348327] [2023-04-02 14:38:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:38:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:56,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:38:56,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122348327] [2023-04-02 14:38:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122348327] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:38:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159419039] [2023-04-02 14:38:56,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:38:56,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:38:56,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:38:56,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:38:56,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 14:38:56,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 14:38:56,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:38:56,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-02 14:38:56,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:38:56,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:38:56,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-04-02 14:38:56,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-04-02 14:38:56,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:38:56,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-04-02 14:38:56,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-04-02 14:38:56,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:38:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:56,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:38:56,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-04-02 14:38:56,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-04-02 14:38:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159419039] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:38:56,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1017474550] [2023-04-02 14:38:56,952 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-04-02 14:38:56,952 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:38:56,952 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:38:56,952 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:38:56,952 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:38:56,993 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:38:57,109 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 39 for LOIs [2023-04-02 14:38:57,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:38:57,134 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:38:57,695 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '361#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (<= 2 ~SIZE~0) (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_2 1) |#StackHeapBarrier|) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) 0) 2))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:38:57,695 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:38:57,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:38:57,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2023-04-02 14:38:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60133912] [2023-04-02 14:38:57,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:38:57,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-02 14:38:57,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:38:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-02 14:38:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2023-04-02 14:38:57,698 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:38:57,882 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-04-02 14:38:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 14:38:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-02 14:38:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:38:57,883 INFO L225 Difference]: With dead ends: 27 [2023-04-02 14:38:57,883 INFO L226 Difference]: Without dead ends: 25 [2023-04-02 14:38:57,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 14:38:57,885 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:38:57,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:38:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-02 14:38:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-04-02 14:38:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 14:38:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-04-02 14:38:57,891 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2023-04-02 14:38:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:38:57,891 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-04-02 14:38:57,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 14:38:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-04-02 14:38:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 14:38:57,892 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:38:57,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:38:57,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 14:38:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-02 14:38:58,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:38:58,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:38:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1923393446, now seen corresponding path program 1 times [2023-04-02 14:38:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:38:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033347819] [2023-04-02 14:38:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:38:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:58,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:38:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033347819] [2023-04-02 14:38:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033347819] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:38:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389656361] [2023-04-02 14:38:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:38:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:38:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:38:58,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:38:58,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 14:38:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:38:58,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-02 14:38:58,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:38:58,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:38:58,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:38:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:58,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:38:58,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-04-02 14:38:58,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-04-02 14:38:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:38:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389656361] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:38:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100990952] [2023-04-02 14:38:58,912 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:38:58,912 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:38:58,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:38:58,913 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:38:58,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:38:58,965 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:38:59,290 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:38:59,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:38:59,329 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:00,017 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '605#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (exists ((v_main_~i~0_BEFORE_CALL_9 Int) (v_main_~a~0.base_BEFORE_CALL_9 Int)) (and (< v_main_~i~0_BEFORE_CALL_9 ~SIZE~0) (<= (+ v_main_~a~0.base_BEFORE_CALL_9 1) |#StackHeapBarrier|) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_9) (* v_main_~i~0_BEFORE_CALL_9 4)) 2) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_9 99999)) (<= 1 (+ v_main_~i~0_BEFORE_CALL_9 |#StackHeapBarrier|)) (<= 0 v_main_~i~0_BEFORE_CALL_9) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_9)))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:00,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:00,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 25 [2023-04-02 14:39:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457608988] [2023-04-02 14:39:00,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:00,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 14:39:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 14:39:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2023-04-02 14:39:00,020 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:02,112 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2023-04-02 14:39:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 14:39:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-04-02 14:39:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:02,115 INFO L225 Difference]: With dead ends: 50 [2023-04-02 14:39:02,115 INFO L226 Difference]: Without dead ends: 48 [2023-04-02 14:39:02,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2023-04-02 14:39:02,116 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:02,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 133 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 3 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 14:39:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-02 14:39:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2023-04-02 14:39:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-04-02 14:39:02,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2023-04-02 14:39:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:02,124 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-04-02 14:39:02,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-04-02 14:39:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 14:39:02,125 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:02,125 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:02,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 14:39:02,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:02,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:02,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1910038712, now seen corresponding path program 2 times [2023-04-02 14:39:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404039389] [2023-04-02 14:39:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:39:02,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404039389] [2023-04-02 14:39:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404039389] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279622877] [2023-04-02 14:39:02,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:39:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:02,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:02,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 14:39:02,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 14:39:02,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:02,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-02 14:39:02,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:02,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:02,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-04-02 14:39:02,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2023-04-02 14:39:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:39:02,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-04-02 14:39:02,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-04-02 14:39:02,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:39:02,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-04-02 14:39:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:39:03,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:03,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-04-02 14:39:03,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-04-02 14:39:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 14:39:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279622877] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674979003] [2023-04-02 14:39:03,532 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:03,532 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:03,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:03,532 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:03,532 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:03,571 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:03,857 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:03,887 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:03,894 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:04,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '906#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~a~0.base_BEFORE_CALL_18 Int) (v_main_~i~0_BEFORE_CALL_18 Int)) (and (<= 1 (+ v_main_~i~0_BEFORE_CALL_18 |#StackHeapBarrier|)) (<= (+ v_main_~a~0.base_BEFORE_CALL_18 1) |#StackHeapBarrier|) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_18 99999)) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_18)) (<= 0 v_main_~i~0_BEFORE_CALL_18) (< v_main_~i~0_BEFORE_CALL_18 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_18) (* v_main_~i~0_BEFORE_CALL_18 4)) 2))) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:04,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:04,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:04,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 28 [2023-04-02 14:39:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132421594] [2023-04-02 14:39:04,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:04,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-04-02 14:39:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-04-02 14:39:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 14:39:04,647 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 28 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:06,432 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-04-02 14:39:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-02 14:39:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2023-04-02 14:39:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:06,434 INFO L225 Difference]: With dead ends: 61 [2023-04-02 14:39:06,435 INFO L226 Difference]: Without dead ends: 59 [2023-04-02 14:39:06,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2023-04-02 14:39:06,437 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:06,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 512 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 14:39:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-04-02 14:39:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2023-04-02 14:39:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-04-02 14:39:06,447 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2023-04-02 14:39:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:06,448 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-04-02 14:39:06,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-04-02 14:39:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 14:39:06,449 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:06,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:06,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 14:39:06,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:06,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:06,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1545524492, now seen corresponding path program 3 times [2023-04-02 14:39:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768831998] [2023-04-02 14:39:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:06,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768831998] [2023-04-02 14:39:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768831998] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256298493] [2023-04-02 14:39:06,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 14:39:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:06,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:06,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 14:39:06,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 14:39:06,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:06,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-02 14:39:06,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:06,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256298493] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644266777] [2023-04-02 14:39:06,940 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:06,941 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:06,941 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:06,941 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:06,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:06,972 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:07,239 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:07,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:07,276 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:07,745 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1261#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (exists ((v_main_~a~0.base_BEFORE_CALL_25 Int) (v_main_~i~0_BEFORE_CALL_29 Int)) (and (<= 0 v_main_~i~0_BEFORE_CALL_29) (<= 1 (+ v_main_~i~0_BEFORE_CALL_29 |#StackHeapBarrier|)) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_29)) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_25) (* v_main_~i~0_BEFORE_CALL_29 4)) 2) (<= (+ v_main_~a~0.base_BEFORE_CALL_25 1) |#StackHeapBarrier|) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_29 99999)) (< v_main_~i~0_BEFORE_CALL_29 ~SIZE~0))) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:07,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:07,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:07,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-04-02 14:39:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378881780] [2023-04-02 14:39:07,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 14:39:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 14:39:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-04-02 14:39:07,747 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 14:39:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:07,842 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-04-02 14:39:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 14:39:07,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-04-02 14:39:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:07,843 INFO L225 Difference]: With dead ends: 60 [2023-04-02 14:39:07,844 INFO L226 Difference]: Without dead ends: 36 [2023-04-02 14:39:07,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2023-04-02 14:39:07,845 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:07,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:39:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-02 14:39:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-04-02 14:39:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:39:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-04-02 14:39:07,852 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2023-04-02 14:39:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:07,852 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-04-02 14:39:07,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 14:39:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-04-02 14:39:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 14:39:07,853 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:07,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:07,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:08,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:08,057 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:08,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1517893906, now seen corresponding path program 4 times [2023-04-02 14:39:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137595118] [2023-04-02 14:39:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:08,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137595118] [2023-04-02 14:39:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137595118] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854053152] [2023-04-02 14:39:08,370 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 14:39:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:08,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:08,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 14:39:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:08,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-02 14:39:08,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:08,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:08,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:39:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:08,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:08,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-04-02 14:39:08,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-04-02 14:39:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854053152] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [4907988] [2023-04-02 14:39:09,046 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:09,046 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:09,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:09,047 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:09,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:09,073 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:09,332 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:09,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:09,368 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:10,092 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1617#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~i~0_BEFORE_CALL_40 Int) (v_main_~a~0.base_BEFORE_CALL_36 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_36 1) |#StackHeapBarrier|) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_40)) (<= 0 v_main_~i~0_BEFORE_CALL_40) (<= 1 (+ v_main_~i~0_BEFORE_CALL_40 |#StackHeapBarrier|)) (< v_main_~i~0_BEFORE_CALL_40 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_36) (* v_main_~i~0_BEFORE_CALL_40 4)) 2) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_40 99999)))) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:10,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:10,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 31 [2023-04-02 14:39:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408538993] [2023-04-02 14:39:10,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:10,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-02 14:39:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-02 14:39:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 14:39:10,095 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 31 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:13,013 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-04-02 14:39:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 14:39:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2023-04-02 14:39:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:13,014 INFO L225 Difference]: With dead ends: 65 [2023-04-02 14:39:13,015 INFO L226 Difference]: Without dead ends: 63 [2023-04-02 14:39:13,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=212, Invalid=2650, Unknown=0, NotChecked=0, Total=2862 [2023-04-02 14:39:13,016 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:13,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 248 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 393 Invalid, 4 Unknown, 0 Unchecked, 2.6s Time] [2023-04-02 14:39:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-02 14:39:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2023-04-02 14:39:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 14:39:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-04-02 14:39:13,026 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2023-04-02 14:39:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:13,026 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-04-02 14:39:13,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-04-02 14:39:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 14:39:13,027 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:13,027 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:13,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:13,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:13,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:13,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1994583732, now seen corresponding path program 5 times [2023-04-02 14:39:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875064254] [2023-04-02 14:39:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:13,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875064254] [2023-04-02 14:39:13,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875064254] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70987691] [2023-04-02 14:39:13,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:39:13,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:13,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:13,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 14:39:13,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 14:39:13,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:13,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-02 14:39:13,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:13,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:13,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-04-02 14:39:13,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-04-02 14:39:13,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:39:13,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-04-02 14:39:13,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-04-02 14:39:14,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:39:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:14,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:14,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-04-02 14:39:14,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2023-04-02 14:39:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 14:39:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70987691] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492443567] [2023-04-02 14:39:14,479 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:14,479 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:14,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:14,480 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:14,480 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:14,516 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:14,776 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:14,802 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:14,806 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:15,504 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2018#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0) (exists ((v_main_~i~0_BEFORE_CALL_51 Int) (v_main_~a~0.base_BEFORE_CALL_47 Int)) (and (< v_main_~i~0_BEFORE_CALL_51 ~SIZE~0) (<= 1 (+ v_main_~i~0_BEFORE_CALL_51 |#StackHeapBarrier|)) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_47) (* v_main_~i~0_BEFORE_CALL_51 4)) 2) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_51 99999)) (<= 0 v_main_~i~0_BEFORE_CALL_51) (<= (+ v_main_~a~0.base_BEFORE_CALL_47 1) |#StackHeapBarrier|) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_51)))))' at error location [2023-04-02 14:39:15,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:15,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34 [2023-04-02 14:39:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488908217] [2023-04-02 14:39:15,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:15,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-04-02 14:39:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-04-02 14:39:15,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2023-04-02 14:39:15,507 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 34 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:17,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:39:19,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:39:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:20,104 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2023-04-02 14:39:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 14:39:20,104 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 30 [2023-04-02 14:39:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:20,105 INFO L225 Difference]: With dead ends: 59 [2023-04-02 14:39:20,105 INFO L226 Difference]: Without dead ends: 57 [2023-04-02 14:39:20,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=2954, Unknown=0, NotChecked=0, Total=3192 [2023-04-02 14:39:20,107 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:20,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 223 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 505 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2023-04-02 14:39:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-02 14:39:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-04-02 14:39:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-04-02 14:39:20,118 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 30 [2023-04-02 14:39:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:20,119 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-04-02 14:39:20,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-04-02 14:39:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 14:39:20,120 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:20,120 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:20,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:20,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:20,327 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:20,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1660315656, now seen corresponding path program 6 times [2023-04-02 14:39:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123109160] [2023-04-02 14:39:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:20,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123109160] [2023-04-02 14:39:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123109160] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778255040] [2023-04-02 14:39:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 14:39:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:20,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 14:39:20,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 14:39:20,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:20,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-02 14:39:20,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:20,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778255040] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247328563] [2023-04-02 14:39:20,676 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:20,676 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:20,676 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:20,676 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:20,676 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:20,702 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:20,950 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:20,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:20,981 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:21,522 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2445#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (exists ((v_main_~a~0.base_BEFORE_CALL_54 Int) (v_main_~i~0_BEFORE_CALL_64 Int)) (and (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_54) (* v_main_~i~0_BEFORE_CALL_64 4)) 2) (<= 0 v_main_~i~0_BEFORE_CALL_64) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_64 99999)) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_64)) (<= 1 (+ v_main_~i~0_BEFORE_CALL_64 |#StackHeapBarrier|)) (< v_main_~i~0_BEFORE_CALL_64 ~SIZE~0) (<= (+ v_main_~a~0.base_BEFORE_CALL_54 1) |#StackHeapBarrier|))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:21,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:21,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 17 [2023-04-02 14:39:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651529915] [2023-04-02 14:39:21,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:21,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-02 14:39:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-02 14:39:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2023-04-02 14:39:21,524 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 14:39:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:21,651 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-04-02 14:39:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 14:39:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 36 [2023-04-02 14:39:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:21,652 INFO L225 Difference]: With dead ends: 75 [2023-04-02 14:39:21,652 INFO L226 Difference]: Without dead ends: 44 [2023-04-02 14:39:21,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2023-04-02 14:39:21,653 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:39:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-02 14:39:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-04-02 14:39:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 14:39:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-04-02 14:39:21,662 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2023-04-02 14:39:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:21,662 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-04-02 14:39:21,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 14:39:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-04-02 14:39:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-02 14:39:21,663 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:21,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:21,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:21,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-02 14:39:21,869 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:21,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 530937894, now seen corresponding path program 7 times [2023-04-02 14:39:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985968309] [2023-04-02 14:39:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:22,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985968309] [2023-04-02 14:39:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985968309] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452668232] [2023-04-02 14:39:22,275 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 14:39:22,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:22,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:22,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 14:39:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:22,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-02 14:39:22,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:22,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:22,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:39:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:22,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:22,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-04-02 14:39:22,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-04-02 14:39:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452668232] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:23,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265839937] [2023-04-02 14:39:23,060 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:23,060 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:23,060 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:23,061 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:23,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:23,095 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:23,347 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:23,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:23,380 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:24,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2891#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (exists ((v_main_~a~0.base_BEFORE_CALL_67 Int) (v_main_~i~0_BEFORE_CALL_77 Int)) (and (<= 1 (+ v_main_~i~0_BEFORE_CALL_77 |#StackHeapBarrier|)) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_77 99999)) (< v_main_~i~0_BEFORE_CALL_77 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_67) (* v_main_~i~0_BEFORE_CALL_77 4)) 2) (<= 0 v_main_~i~0_BEFORE_CALL_77) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_77)) (<= (+ v_main_~a~0.base_BEFORE_CALL_67 1) |#StackHeapBarrier|))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:24,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:24,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2023-04-02 14:39:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915263930] [2023-04-02 14:39:24,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-04-02 14:39:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-04-02 14:39:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2180, Unknown=0, NotChecked=0, Total=2352 [2023-04-02 14:39:24,098 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 37 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:28,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:39:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:28,958 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2023-04-02 14:39:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 14:39:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 37 [2023-04-02 14:39:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:28,959 INFO L225 Difference]: With dead ends: 80 [2023-04-02 14:39:28,959 INFO L226 Difference]: Without dead ends: 78 [2023-04-02 14:39:28,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2023-04-02 14:39:28,961 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:28,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 257 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 5 Unknown, 0 Unchecked, 4.8s Time] [2023-04-02 14:39:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-04-02 14:39:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2023-04-02 14:39:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 14:39:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2023-04-02 14:39:28,972 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 37 [2023-04-02 14:39:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:28,973 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2023-04-02 14:39:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 35 states have internal predecessors, (52), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2023-04-02 14:39:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-02 14:39:28,973 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:28,974 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:28,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:29,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 14:39:29,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:29,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -120034360, now seen corresponding path program 8 times [2023-04-02 14:39:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712323006] [2023-04-02 14:39:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:29,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712323006] [2023-04-02 14:39:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712323006] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773545856] [2023-04-02 14:39:29,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:39:29,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:29,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:29,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:29,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 14:39:29,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-04-02 14:39:29,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:29,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-02 14:39:29,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:29,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:29,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-04-02 14:39:29,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2023-04-02 14:39:29,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-04-02 14:39:29,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-04-02 14:39:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:30,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:30,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-04-02 14:39:30,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-04-02 14:39:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773545856] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:30,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [483183669] [2023-04-02 14:39:30,697 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:30,697 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:30,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:30,697 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:30,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:30,723 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:30,939 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:30,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:30,973 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:31,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3366#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~a~0.base_BEFORE_CALL_80 Int) (v_main_~i~0_BEFORE_CALL_90 Int)) (and (< v_main_~i~0_BEFORE_CALL_90 ~SIZE~0) (<= 1 (+ v_main_~i~0_BEFORE_CALL_90 |#StackHeapBarrier|)) (<= (+ v_main_~a~0.base_BEFORE_CALL_80 1) |#StackHeapBarrier|) (<= 0 v_main_~i~0_BEFORE_CALL_90) (<= ~SIZE~0 (+ v_main_~i~0_BEFORE_CALL_90 99999)) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_90)) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_80) (* v_main_~i~0_BEFORE_CALL_90 4)) 2))) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:31,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:31,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2023-04-02 14:39:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939721528] [2023-04-02 14:39:31,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:31,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-04-02 14:39:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-04-02 14:39:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2460, Unknown=0, NotChecked=0, Total=2652 [2023-04-02 14:39:31,748 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 40 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:33,140 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2023-04-02 14:39:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-04-02 14:39:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2023-04-02 14:39:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:33,142 INFO L225 Difference]: With dead ends: 133 [2023-04-02 14:39:33,142 INFO L226 Difference]: Without dead ends: 131 [2023-04-02 14:39:33,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=427, Invalid=4975, Unknown=0, NotChecked=0, Total=5402 [2023-04-02 14:39:33,144 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:33,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 365 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 14:39:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-04-02 14:39:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2023-04-02 14:39:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 74 states have internal predecessors, (75), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2023-04-02 14:39:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-04-02 14:39:33,174 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 38 [2023-04-02 14:39:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:33,175 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-04-02 14:39:33,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 13 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-04-02 14:39:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 14:39:33,176 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:33,176 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:33,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:33,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 14:39:33,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:33,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1639415928, now seen corresponding path program 9 times [2023-04-02 14:39:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347586492] [2023-04-02 14:39:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:39:34,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347586492] [2023-04-02 14:39:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347586492] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741298258] [2023-04-02 14:39:34,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 14:39:34,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:34,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:34,107 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:34,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 14:39:34,242 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 14:39:34,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:34,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 50 conjunts are in the unsatisfiable core [2023-04-02 14:39:34,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:34,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 14:39:34,413 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-04-02 14:39:34,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 83 [2023-04-02 14:39:34,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2023-04-02 14:39:34,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 14:39:34,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-04-02 14:39:34,542 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-04-02 14:39:34,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 83 [2023-04-02 14:39:34,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2023-04-02 14:39:34,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 14:39:34,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-04-02 14:39:34,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2023-04-02 14:39:34,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2023-04-02 14:39:34,662 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-04-02 14:39:34,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-04-02 14:39:34,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-04-02 14:39:34,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 14:39:41,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-04-02 14:39:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 14:39:41,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:44,946 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (v_main_~i~0_212 Int) (v_main_~i~0_213 Int) (v_ArrVal_367 Int) (v_ArrVal_366 Int) (v_ArrVal_363 Int) (v_ArrVal_371 Int)) (or (< v_main_~i~0_213 (+ c_main_~i~0 1)) (< v_main_~i~0_212 (+ v_main_~i~0_213 1)) (< c_main_~low~0 (+ (select (store (let ((.cse1 (* 4 v_main_~i~0_213))) (store (store (let ((.cse0 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_363) (+ .cse0 c_main_~a~0.offset) v_ArrVal_366)) (+ c_main_~a~0.offset .cse1 4) v_ArrVal_368) (+ c_main_~a~0.offset .cse1) v_ArrVal_367)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_212)) v_ArrVal_371) (+ c_main_~a~0.offset 12)) 1)))) is different from false [2023-04-02 14:39:44,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2023-04-02 14:39:44,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61686 treesize of output 61430 [2023-04-02 14:39:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 7 not checked. [2023-04-02 14:39:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741298258] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933736208] [2023-04-02 14:39:45,545 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:45,545 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:45,546 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:45,546 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:45,546 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:45,568 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:45,783 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:45,807 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:45,812 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:46,619 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4063#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (exists ((v_main_~a~0.base_BEFORE_CALL_93 Int) (v_main_~i~0_BEFORE_CALL_103 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_93 1) |#StackHeapBarrier|) (< v_main_~i~0_BEFORE_CALL_103 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_93) (* v_main_~i~0_BEFORE_CALL_103 4)) 2) (<= 1 (+ v_main_~i~0_BEFORE_CALL_103 |#StackHeapBarrier|)) (<= ~SIZE~0 (+ 99999 v_main_~i~0_BEFORE_CALL_103)) (<= 0 v_main_~i~0_BEFORE_CALL_103) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_103)))) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:46,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:46,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 17] total 48 [2023-04-02 14:39:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479501773] [2023-04-02 14:39:46,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-04-02 14:39:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:46,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-04-02 14:39:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3201, Unknown=3, NotChecked=114, Total=3540 [2023-04-02 14:39:46,624 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 48 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 13 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:48,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-02 14:39:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:39:52,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:39:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:54,440 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-04-02 14:39:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 14:39:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 13 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 40 [2023-04-02 14:39:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:54,442 INFO L225 Difference]: With dead ends: 124 [2023-04-02 14:39:54,442 INFO L226 Difference]: Without dead ends: 122 [2023-04-02 14:39:54,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=536, Invalid=6605, Unknown=3, NotChecked=166, Total=7310 [2023-04-02 14:39:54,444 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 49 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:54,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 177 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1513 Invalid, 3 Unknown, 72 Unchecked, 6.5s Time] [2023-04-02 14:39:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-04-02 14:39:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2023-04-02 14:39:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 60 states have internal predecessors, (61), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2023-04-02 14:39:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-04-02 14:39:54,468 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 40 [2023-04-02 14:39:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:54,468 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-04-02 14:39:54,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 13 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-04-02 14:39:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-02 14:39:54,470 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:54,470 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:54,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-04-02 14:39:54,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 14:39:54,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:54,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1005374068, now seen corresponding path program 10 times [2023-04-02 14:39:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523645456] [2023-04-02 14:39:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:54,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523645456] [2023-04-02 14:39:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523645456] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271312] [2023-04-02 14:39:54,801 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 14:39:54,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:54,802 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:54,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 14:39:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:54,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-02 14:39:54,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:55,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271312] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:55,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112529480] [2023-04-02 14:39:55,105 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:55,105 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:55,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:55,106 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:55,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:55,139 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:55,356 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:55,402 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:55,408 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:55,940 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4720#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~i~0_BEFORE_CALL_118 Int) (v_main_~a~0.base_BEFORE_CALL_100 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_100 1) |#StackHeapBarrier|) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_118)) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_100) (* v_main_~i~0_BEFORE_CALL_118 4)) 2) (<= ~SIZE~0 (+ 99999 v_main_~i~0_BEFORE_CALL_118)) (<= 0 v_main_~i~0_BEFORE_CALL_118) (< v_main_~i~0_BEFORE_CALL_118 ~SIZE~0) (<= 1 (+ v_main_~i~0_BEFORE_CALL_118 |#StackHeapBarrier|)))) (= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:55,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:55,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 20 [2023-04-02 14:39:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171462501] [2023-04-02 14:39:55,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-02 14:39:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-02 14:39:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2023-04-02 14:39:55,941 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:39:56,124 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2023-04-02 14:39:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 14:39:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 44 [2023-04-02 14:39:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:39:56,126 INFO L225 Difference]: With dead ends: 117 [2023-04-02 14:39:56,126 INFO L226 Difference]: Without dead ends: 79 [2023-04-02 14:39:56,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 14:39:56,127 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:39:56,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:39:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-02 14:39:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2023-04-02 14:39:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 14:39:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2023-04-02 14:39:56,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 44 [2023-04-02 14:39:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:39:56,143 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2023-04-02 14:39:56,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 14:39:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2023-04-02 14:39:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-02 14:39:56,144 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:39:56,144 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:39:56,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 14:39:56,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 14:39:56,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:39:56,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:39:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash -798028236, now seen corresponding path program 11 times [2023-04-02 14:39:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:39:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665368915] [2023-04-02 14:39:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:39:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:39:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:39:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:56,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:39:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665368915] [2023-04-02 14:39:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665368915] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:39:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494412803] [2023-04-02 14:39:56,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:39:56,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:39:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:39:56,856 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:39:56,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-02 14:39:56,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-02 14:39:56,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:39:56,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-02 14:39:56,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:39:57,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:39:57,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-04-02 14:39:57,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-04-02 14:39:57,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-04-02 14:39:57,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-04-02 14:39:57,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 14:39:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:57,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:39:57,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-04-02 14:39:58,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-04-02 14:39:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:39:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494412803] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:39:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064826132] [2023-04-02 14:39:58,154 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:39:58,154 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:39:58,154 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:39:58,155 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:39:58,155 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:39:58,183 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2023-04-02 14:39:58,391 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-02 14:39:58,416 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-02 14:39:58,422 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:39:59,299 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5318#(and (<= 1 |#StackHeapBarrier|) (= ~MAX~0 100000) (exists ((v_main_~a~0.base_BEFORE_CALL_115 Int) (v_main_~i~0_BEFORE_CALL_133 Int)) (and (<= ~SIZE~0 (+ 99999 v_main_~i~0_BEFORE_CALL_133)) (<= 1 (+ v_main_~i~0_BEFORE_CALL_133 |#StackHeapBarrier|)) (<= 0 v_main_~i~0_BEFORE_CALL_133) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_115) (* v_main_~i~0_BEFORE_CALL_133 4)) 2) (< v_main_~i~0_BEFORE_CALL_133 ~SIZE~0) (<= (+ v_main_~a~0.base_BEFORE_CALL_115 1) |#StackHeapBarrier|) (<= 2 (+ ~SIZE~0 v_main_~i~0_BEFORE_CALL_133)))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~SIZE~0 99999) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 14:39:59,299 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:39:59,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 14:39:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 46 [2023-04-02 14:39:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890489196] [2023-04-02 14:39:59,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 14:39:59,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-04-02 14:39:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:39:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-04-02 14:39:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2023-04-02 14:39:59,302 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 46 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 14:40:00,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:40:02,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:40:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 14:40:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:40:08,776 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2023-04-02 14:40:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-04-02 14:40:08,777 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 46 [2023-04-02 14:40:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:40:08,778 INFO L225 Difference]: With dead ends: 145 [2023-04-02 14:40:08,778 INFO L226 Difference]: Without dead ends: 143 [2023-04-02 14:40:08,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=377, Invalid=5943, Unknown=0, NotChecked=0, Total=6320 [2023-04-02 14:40:08,780 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 51 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-04-02 14:40:08,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 298 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 855 Invalid, 7 Unknown, 0 Unchecked, 8.7s Time] [2023-04-02 14:40:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-04-02 14:40:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2023-04-02 14:40:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.064102564102564) internal successors, (83), 82 states have internal predecessors, (83), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (19), 15 states have call predecessors, (19), 19 states have call successors, (19) [2023-04-02 14:40:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2023-04-02 14:40:08,820 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 46 [2023-04-02 14:40:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:40:08,820 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2023-04-02 14:40:08,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 14:40:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2023-04-02 14:40:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 14:40:08,821 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:40:08,821 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:40:08,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-02 14:40:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-02 14:40:09,032 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:40:09,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:40:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1299145204, now seen corresponding path program 12 times [2023-04-02 14:40:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:40:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134132611] [2023-04-02 14:40:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:40:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:40:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:40:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 14:40:09,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:40:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134132611] [2023-04-02 14:40:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134132611] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 14:40:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158489318] [2023-04-02 14:40:09,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 14:40:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:40:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:40:09,785 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:40:09,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-02 14:40:10,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 14:40:10,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:40:10,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 70 conjunts are in the unsatisfiable core [2023-04-02 14:40:10,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:40:10,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 14:40:10,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-04-02 14:40:10,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 14:40:10,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-04-02 14:40:10,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-04-02 14:40:10,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-04-02 14:40:10,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2023-04-02 14:40:10,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 14:40:10,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2023-04-02 14:40:10,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-04-02 14:40:10,291 INFO L321 Elim1Store]: treesize reduction 112, result has 24.8 percent of original size [2023-04-02 14:40:10,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 98 [2023-04-02 14:40:10,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-04-02 14:40:10,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-04-02 14:40:10,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 14:40:10,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2023-04-02 14:40:10,416 INFO L321 Elim1Store]: treesize reduction 112, result has 24.8 percent of original size [2023-04-02 14:40:10,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 98 [2023-04-02 14:40:10,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-04-02 14:40:10,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-04-02 14:40:10,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-04-02 14:40:10,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2023-04-02 14:40:10,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2023-04-02 14:40:10,523 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-02 14:40:10,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 33 [2023-04-02 14:40:10,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-04-02 14:40:10,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 14:40:10,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2023-04-02 14:40:25,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 14:40:25,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-04-02 14:40:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 76 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 14:40:25,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:40:28,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2023-04-02 14:40:52,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 557575 column 7: canceled [2023-04-02 14:40:52,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1095955668] [2023-04-02 14:40:52,511 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-02 14:40:52,511 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:40:52,512 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:40:52,512 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:40:52,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:40:54,516 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 557577 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:263) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StateBasedDomain.isEqBottom(StateBasedDomain.java:112) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) 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:68) 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.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-02 14:40:54,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-04-02 14:40:54,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-04-02 14:40:54,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754422487] [2023-04-02 14:40:54,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-04-02 14:40:54,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 14:40:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:40:54,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 14:40:54,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2813, Unknown=2, NotChecked=0, Total=3080 [2023-04-02 14:40:54,519 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 14:40:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 14:40:56,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=265, Invalid=2813, Unknown=2, NotChecked=0, Total=3080 [2023-04-02 14:40:56,529 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:40:56,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 14:40:56,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-04-02 14:40:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:40:56,730 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 557579 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.push(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:366) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-02 14:40:56,732 INFO L158 Benchmark]: Toolchain (without parser) took 123984.62ms. Allocated memory was 329.3MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 291.7MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-04-02 14:40:56,732 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 14:40:56,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.45ms. Allocated memory is still 329.3MB. Free memory was 291.7MB in the beginning and 281.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 14:40:56,733 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 329.3MB. Free memory was 281.1MB in the beginning and 279.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 14:40:56,733 INFO L158 Benchmark]: RCFGBuilder took 286.23ms. Allocated memory is still 329.3MB. Free memory was 279.3MB in the beginning and 265.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-02 14:40:56,733 INFO L158 Benchmark]: TraceAbstraction took 123438.79ms. Allocated memory was 329.3MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 265.0MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-04-02 14:40:56,734 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.13ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.45ms. Allocated memory is still 329.3MB. Free memory was 291.7MB in the beginning and 281.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 329.3MB. Free memory was 281.1MB in the beginning and 279.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 286.23ms. Allocated memory is still 329.3MB. Free memory was 279.3MB in the beginning and 265.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 123438.79ms. Allocated memory was 329.3MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 265.0MB in the beginning and 5.8GB in the end (delta: -5.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 557579 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 557579 column 7: canceled: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-04-02 14:40:56,948 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-04-02 14:40:57,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...