/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 EqDomain -i ../sv-benchmarks/c/array-fpi/brs2f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 09:03:21,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 09:03:21,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 09:03:21,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 09:03:21,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 09:03:21,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 09:03:21,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 09:03:21,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 09:03:21,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 09:03:21,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 09:03:21,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 09:03:21,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 09:03:21,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 09:03:21,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 09:03:21,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 09:03:21,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 09:03:21,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 09:03:21,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 09:03:21,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 09:03:21,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 09:03:21,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 09:03:21,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 09:03:21,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 09:03:21,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 09:03:21,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 09:03:21,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 09:03:21,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 09:03:21,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 09:03:21,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 09:03:21,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 09:03:21,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 09:03:21,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 09:03:21,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 09:03:21,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 09:03:21,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 09:03:21,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 09:03:21,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 09:03:21,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 09:03:21,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 09:03:21,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 09:03:21,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 09:03:21,559 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-01 09:03:21,576 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 09:03:21,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 09:03:21,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 09:03:21,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 09:03:21,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 09:03:21,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 09:03:21,582 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 09:03:21,582 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 09:03:21,583 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 09:03:21,583 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 09:03:21,583 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 09:03:21,583 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 09:03:21,583 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 09:03:21,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 09:03:21,584 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 09:03:21,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 09:03:21,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 09:03:21,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 09:03:21,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 09:03:21,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 09:03:21,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 09:03:21,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 09:03:21,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 09:03:21,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 09:03:21,586 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 09:03:21,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 09:03:21,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 09:03:21,587 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 09:03:21,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 09:03:21,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 09:03:21,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 09:03:21,587 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 -> EqDomain [2023-04-01 09:03:21,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 09:03:21,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 09:03:21,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 09:03:21,807 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 09:03:21,808 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 09:03:21,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs2f.c [2023-04-01 09:03:22,810 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 09:03:22,985 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 09:03:22,986 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c [2023-04-01 09:03:22,990 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94c8e53b/7c5b356028f64fe482a288cc8a1b578a/FLAGc48a898dc [2023-04-01 09:03:23,003 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94c8e53b/7c5b356028f64fe482a288cc8a1b578a [2023-04-01 09:03:23,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 09:03:23,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 09:03:23,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 09:03:23,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 09:03:23,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 09:03:23,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e67c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23, skipping insertion in model container [2023-04-01 09:03:23,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 09:03:23,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 09:03:23,143 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-fpi/brs2f.c[588,601] [2023-04-01 09:03:23,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 09:03:23,164 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 09:03:23,173 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-fpi/brs2f.c[588,601] [2023-04-01 09:03:23,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 09:03:23,186 INFO L208 MainTranslator]: Completed translation [2023-04-01 09:03:23,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23 WrapperNode [2023-04-01 09:03:23,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 09:03:23,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 09:03:23,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 09:03:23,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 09:03:23,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,207 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 09:03:23,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 09:03:23,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 09:03:23,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 09:03:23,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (1/1) ... [2023-04-01 09:03:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 09:03:23,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:23,240 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-01 09:03:23,245 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-01 09:03:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 09:03:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 09:03:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 09:03:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 09:03:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 09:03:23,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 09:03:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 09:03:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 09:03:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 09:03:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 09:03:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 09:03:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 09:03:23,337 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 09:03:23,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 09:03:23,499 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 09:03:23,529 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 09:03:23,530 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-01 09:03:23,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 09:03:23 BoogieIcfgContainer [2023-04-01 09:03:23,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 09:03:23,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 09:03:23,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 09:03:23,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 09:03:23,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 09:03:23" (1/3) ... [2023-04-01 09:03:23,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 09:03:23, skipping insertion in model container [2023-04-01 09:03:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:23" (2/3) ... [2023-04-01 09:03:23,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 09:03:23, skipping insertion in model container [2023-04-01 09:03:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 09:03:23" (3/3) ... [2023-04-01 09:03:23,546 INFO L112 eAbstractionObserver]: Analyzing ICFG brs2f.c [2023-04-01 09:03:23,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 09:03:23,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 09:03:23,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 09:03:23,601 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;@317fcae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 09:03:23,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 09:03:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 09:03:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-01 09:03:23,608 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:23,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:23,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:23,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1699617010, now seen corresponding path program 1 times [2023-04-01 09:03:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839451855] [2023-04-01 09:03:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:23,817 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-01 09:03:23,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839451855] [2023-04-01 09:03:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839451855] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 09:03:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 09:03:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 09:03:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582509193] [2023-04-01 09:03:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 09:03:23,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 09:03:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 09:03:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 09:03:23,844 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:23,914 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-04-01 09:03:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 09:03:23,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-04-01 09:03:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:23,920 INFO L225 Difference]: With dead ends: 43 [2023-04-01 09:03:23,920 INFO L226 Difference]: Without dead ends: 19 [2023-04-01 09:03:23,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 09:03:23,924 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:23,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 09:03:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-04-01 09:03:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-04-01 09:03:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-04-01 09:03:23,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2023-04-01 09:03:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:23,950 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-04-01 09:03:23,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-04-01 09:03:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-01 09:03:23,959 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:23,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:23,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 09:03:23,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:23,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -29676778, now seen corresponding path program 1 times [2023-04-01 09:03:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701123032] [2023-04-01 09:03:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:03:24,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701123032] [2023-04-01 09:03:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701123032] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:03:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314108124] [2023-04-01 09:03:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:03:24,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:24,299 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-01 09:03:24,328 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-01 09:03:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:24,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 09:03:24,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:03:24,454 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-01 09:03:24,479 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-01 09:03:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:03:24,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:03:24,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 09:03:24,628 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 4 case distinctions, treesize of input 37 treesize of output 51 [2023-04-01 09:03:24,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 09:03:24,649 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-04-01 09:03:24,698 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 9 treesize of output 7 [2023-04-01 09:03:24,705 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 15 [2023-04-01 09:03:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:03:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314108124] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:03:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1913561002] [2023-04-01 09:03:24,778 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 09:03:24,779 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:03:24,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:03:24,784 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:03:24,784 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:03:24,971 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 87 for LOIs [2023-04-01 09:03:26,922 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 124 for LOIs [2023-04-01 09:03:27,080 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 92 for LOIs [2023-04-01 09:03:27,090 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:03:27,095 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:03:28,821 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '241#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (|v_old(#length)_BEFORE_CALL_3| (Array Int Int)) (|v_main_~#sum~0.offset_BEFORE_CALL_1| Int) (|v_old(#memory_int)_BEFORE_CALL_3| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_3| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_old(~N~0)_BEFORE_CALL_3| Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (and (<= ~N~0 v_main_~i~0_BEFORE_CALL_1) (or (and (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#length)_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 3) 50) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 7) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 6) 99) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 0) 48) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_3| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_3| |v_old(#length)_BEFORE_CALL_3|)) (not (= v_main_~a~0.base_BEFORE_CALL_1 0)) (not (= v_main_~i~0_BEFORE_CALL_1 8)) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 0)) (= |v_main_~#sum~0.offset_BEFORE_CALL_1| 0) (= (select |v_old(#valid)_BEFORE_CALL_3| |v_main_~#sum~0.base_BEFORE_CALL_1|) 0) (= 114 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 1)) (= 2 (select |v_old(#length)_BEFORE_CALL_3| 1)) (= (select |v_old(#length)_BEFORE_CALL_3| 3) 12) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= |v_old(#length)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#valid)_BEFORE_CALL_3|)) (= (select |v_old(#length)_BEFORE_CALL_3| 2) 8) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= v_main_~a~0.offset_BEFORE_CALL_1 0) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= v_main_~a~0.base_BEFORE_CALL_1 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (= (select |v_old(#valid)_BEFORE_CALL_3| 2) 1) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_3| 1) 1) (= |v_old(~N~0)_BEFORE_CALL_3| 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 4) 102) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 0)) (= (select |v_old(#valid)_BEFORE_CALL_3| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 5) 46) (= |#NULL.base| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) (select |v_old(#memory_int)_BEFORE_CALL_3| 1)))) (and (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#length)_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 3) 50) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 7) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 6) 99) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 0) 48) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_3| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_3| |v_old(#length)_BEFORE_CALL_3|)) (not (= v_main_~a~0.base_BEFORE_CALL_1 0)) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 0)) (= |v_main_~#sum~0.offset_BEFORE_CALL_1| 0) (= (select |v_old(#valid)_BEFORE_CALL_3| |v_main_~#sum~0.base_BEFORE_CALL_1|) 0) (= 114 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 1)) (= 2 (select |v_old(#length)_BEFORE_CALL_3| 1)) (= (select |v_old(#length)_BEFORE_CALL_3| 3) 12) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= |v_old(#length)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#valid)_BEFORE_CALL_3|)) (= (select |v_old(#length)_BEFORE_CALL_3| 2) 8) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= v_main_~a~0.offset_BEFORE_CALL_1 0) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= v_main_~a~0.base_BEFORE_CALL_1 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (= (select |v_old(#valid)_BEFORE_CALL_3| 2) 1) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_3| 1) 1) (= |v_old(~N~0)_BEFORE_CALL_3| 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 4) 102) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 0)) (= (select |v_old(#valid)_BEFORE_CALL_3| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 5) 46) (= |#NULL.base| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) (select |v_old(#memory_int)_BEFORE_CALL_3| 1))))) (< (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_1|) |v_main_~#sum~0.offset_BEFORE_CALL_1|)))))' at error location [2023-04-01 09:03:28,821 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:03:28,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:03:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-04-01 09:03:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917654108] [2023-04-01 09:03:28,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:03:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 09:03:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 09:03:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=773, Unknown=3, NotChecked=0, Total=870 [2023-04-01 09:03:28,825 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 09:03:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:28,963 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-04-01 09:03:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 09:03:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-04-01 09:03:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:28,964 INFO L225 Difference]: With dead ends: 25 [2023-04-01 09:03:28,964 INFO L226 Difference]: Without dead ends: 20 [2023-04-01 09:03:28,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=934, Unknown=3, NotChecked=0, Total=1056 [2023-04-01 09:03:28,965 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:28,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 61 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 09:03:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-04-01 09:03:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-04-01 09:03:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-04-01 09:03:28,968 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2023-04-01 09:03:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:28,968 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-04-01 09:03:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 09:03:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-04-01 09:03:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 09:03:28,969 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:28,969 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:28,976 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-01 09:03:29,178 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-01 09:03:29,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:29,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1048888652, now seen corresponding path program 2 times [2023-04-01 09:03:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711885079] [2023-04-01 09:03:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:29,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711885079] [2023-04-01 09:03:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711885079] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:03:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473545325] [2023-04-01 09:03:29,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 09:03:29,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:03:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:29,263 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-01 09:03:29,265 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-01 09:03:29,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 09:03:29,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:03:29,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 09:03:29,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:03:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:29,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:03:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473545325] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:03:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288618600] [2023-04-01 09:03:29,382 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 09:03:29,382 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:03:29,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:03:29,382 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:03:29,382 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:03:29,436 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 87 for LOIs [2023-04-01 09:03:30,846 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 124 for LOIs [2023-04-01 09:03:30,983 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 92 for LOIs [2023-04-01 09:03:30,991 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:03:30,995 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:03:32,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '455#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_7| (Array Int Int)) (v_main_~a~0.base_BEFORE_CALL_2 Int) (|v_main_~#sum~0.base_BEFORE_CALL_2| Int) (|v_old(#length)_BEFORE_CALL_7| (Array Int Int)) (|v_main_~#sum~0.offset_BEFORE_CALL_2| Int) (|v_old(~N~0)_BEFORE_CALL_7| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (and (or (and (not (= v_main_~i~0_BEFORE_CALL_2 8)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 7) 0) (= (select |v_old(#valid)_BEFORE_CALL_7| 1) 1) (= v_main_~a~0.offset_BEFORE_CALL_2 0) (= (select |v_old(#valid)_BEFORE_CALL_7| 2) 1) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 2)) (= (select |v_old(#valid)_BEFORE_CALL_7| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 1) 0) (not (= v_main_~a~0.base_BEFORE_CALL_2 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 0) 48) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 0)) (= (select |v_old(#valid)_BEFORE_CALL_7| 3) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#valid)_BEFORE_CALL_7|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#length)_BEFORE_CALL_7|)) (= 102 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 4)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 0) 98) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 3) 50) (= 2 (select |v_old(#length)_BEFORE_CALL_7| 1)) (not (= ~N~0 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 6) 99) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 1)) (not (= |#StackHeapBarrier| 0)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| |#StackHeapBarrier|)) (= 0 (select |v_old(#valid)_BEFORE_CALL_7| |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= 8 (select |v_old(#length)_BEFORE_CALL_7| 2)) (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 5)) (= |v_old(~N~0)_BEFORE_CALL_7| 0) (= |#NULL.offset| 0) (= 114 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 1)) (= |v_main_~#sum~0.offset_BEFORE_CALL_2| 0) (= (select |v_old(#length)_BEFORE_CALL_7| 3) 12) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#length)_BEFORE_CALL_7|)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#valid)_BEFORE_CALL_7|)) (not (= v_main_~a~0.base_BEFORE_CALL_2 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_7| |v_old(#length)_BEFORE_CALL_7|)) (= |#NULL.base| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) (select |v_old(#memory_int)_BEFORE_CALL_7| 2)))) (and (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 7) 0) (= (select |v_old(#valid)_BEFORE_CALL_7| 1) 1) (= v_main_~a~0.offset_BEFORE_CALL_2 0) (= (select |v_old(#valid)_BEFORE_CALL_7| 2) 1) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 2)) (= (select |v_old(#valid)_BEFORE_CALL_7| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 1) 0) (not (= v_main_~a~0.base_BEFORE_CALL_2 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 0) 48) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 0)) (= (select |v_old(#valid)_BEFORE_CALL_7| 3) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#valid)_BEFORE_CALL_7|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#length)_BEFORE_CALL_7|)) (= 102 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 4)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 0) 98) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 3) 50) (= 2 (select |v_old(#length)_BEFORE_CALL_7| 1)) (not (= ~N~0 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 6) 99) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 1)) (not (= |#StackHeapBarrier| 0)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| |#StackHeapBarrier|)) (= 0 (select |v_old(#valid)_BEFORE_CALL_7| |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= 8 (select |v_old(#length)_BEFORE_CALL_7| 2)) (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 5)) (= |v_old(~N~0)_BEFORE_CALL_7| 0) (= |#NULL.offset| 0) (= 114 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 1)) (= |v_main_~#sum~0.offset_BEFORE_CALL_2| 0) (= (select |v_old(#length)_BEFORE_CALL_7| 3) 12) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#length)_BEFORE_CALL_7|)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#valid)_BEFORE_CALL_7|)) (not (= v_main_~a~0.base_BEFORE_CALL_2 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_7| |v_old(#length)_BEFORE_CALL_7|)) (= |#NULL.base| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) (select |v_old(#memory_int)_BEFORE_CALL_7| 2))))) (<= ~N~0 v_main_~i~0_BEFORE_CALL_2) (< (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_2|) |v_main_~#sum~0.offset_BEFORE_CALL_2|)))))' at error location [2023-04-01 09:03:32,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:03:32,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:03:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-04-01 09:03:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091800383] [2023-04-01 09:03:32,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:03:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 09:03:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:32,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 09:03:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=482, Unknown=3, NotChecked=0, Total=552 [2023-04-01 09:03:32,497 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:32,532 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-04-01 09:03:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 09:03:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-04-01 09:03:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:32,533 INFO L225 Difference]: With dead ends: 29 [2023-04-01 09:03:32,534 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 09:03:32,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=523, Unknown=3, NotChecked=0, Total=600 [2023-04-01 09:03:32,535 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:32,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 09:03:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 09:03:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 09:03:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-04-01 09:03:32,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-04-01 09:03:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:32,538 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-04-01 09:03:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-04-01 09:03:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 09:03:32,538 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:32,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:32,553 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-01 09:03:32,742 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-01 09:03:32,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:32,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -97344014, now seen corresponding path program 3 times [2023-04-01 09:03:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855223932] [2023-04-01 09:03:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:33,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855223932] [2023-04-01 09:03:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855223932] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:03:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849372613] [2023-04-01 09:03:33,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 09:03:33,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:03:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:33,259 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-01 09:03:33,261 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-01 09:03:33,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 09:03:33,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:03:33,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjunts are in the unsatisfiable core [2023-04-01 09:03:33,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:03:33,317 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 10 treesize of output 8 [2023-04-01 09:03:33,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2023-04-01 09:03:33,342 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-04-01 09:03:33,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2023-04-01 09:03:33,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 09:03:33,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-04-01 09:03:33,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 10 [2023-04-01 09:03:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:33,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:03:33,567 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 5 treesize of output 3 [2023-04-01 09:03:33,625 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_main_~i~0 0))) (and (or .cse0 (and (forall ((v_ArrVal_116 (Array Int Int)) (|main_~#sum~0.offset| Int)) (< (+ (select v_ArrVal_116 |main_~#sum~0.offset|) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_116) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (+ 5 (* c_main_~i~0 2)))) (not (= (+ c_main_~i~0 1) 0)))) (or (not .cse0) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_117 Int)) (or (< 0 v_ArrVal_117) (< (+ v_ArrVal_117 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |main_~#sum~0.offset| v_ArrVal_117)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 5)))))) is different from false [2023-04-01 09:03:33,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 09:03:33,662 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 4 case distinctions, treesize of input 37 treesize of output 51 [2023-04-01 09:03:33,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 09:03:33,671 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-04-01 09:03:33,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 09:03:33,691 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 134 treesize of output 136 [2023-04-01 09:03:33,697 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 76 treesize of output 68 [2023-04-01 09:03:33,721 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 09:03:33,721 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 26 treesize of output 19 [2023-04-01 09:03:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-04-01 09:03:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849372613] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:03:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840838656] [2023-04-01 09:03:33,762 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 09:03:33,762 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:03:33,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:03:33,762 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:03:33,762 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:03:33,823 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 87 for LOIs [2023-04-01 09:03:35,159 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 124 for LOIs [2023-04-01 09:03:35,301 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 92 for LOIs [2023-04-01 09:03:35,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:03:35,313 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:03:37,084 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '695#(and (exists ((|v_old(#memory_int)_BEFORE_CALL_11| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_11| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_3| Int) (|v_main_~#sum~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0.offset_BEFORE_CALL_3 Int) (|v_old(#length)_BEFORE_CALL_11| (Array Int Int)) (v_main_~i~0_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int) (|v_old(~N~0)_BEFORE_CALL_11| Int)) (and (or (and (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 5)) (= v_main_~a~0.offset_BEFORE_CALL_3 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#valid)_BEFORE_CALL_11|)) (not (= |v_old(#valid)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (= 1 (select |v_old(#valid)_BEFORE_CALL_11| 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 3) 50) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#length)_BEFORE_CALL_11|)) (= |v_main_~#sum~0.offset_BEFORE_CALL_3| 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 6) 99) (not (= |v_old(#length)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~i~0_BEFORE_CALL_3 8)) (not (= v_main_~a~0.base_BEFORE_CALL_3 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_11| |v_main_~#sum~0.base_BEFORE_CALL_3|) 0) (= 12 (select |v_old(#length)_BEFORE_CALL_11| 3)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 7) 0) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 0)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 1) 114) (= (select |v_old(#valid)_BEFORE_CALL_11| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_3 0)) (= |#NULL.offset| 0) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 4) 102) (= |v_old(~N~0)_BEFORE_CALL_11| 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 1)) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 0)) (= 8 (select |v_old(#length)_BEFORE_CALL_11| 2)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 0)) (= (select |v_old(#valid)_BEFORE_CALL_11| 3) 1) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select |v_old(#length)_BEFORE_CALL_11| 1) 2) (not (= |v_old(#valid)_BEFORE_CALL_11| |v_old(#length)_BEFORE_CALL_11|)) (= (select |v_old(#valid)_BEFORE_CALL_11| 0) 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| |#StackHeapBarrier|)) (= |#NULL.base| 0)) (and (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 5)) (= v_main_~a~0.offset_BEFORE_CALL_3 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#valid)_BEFORE_CALL_11|)) (not (= |v_old(#valid)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (= 1 (select |v_old(#valid)_BEFORE_CALL_11| 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 3) 50) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#length)_BEFORE_CALL_11|)) (= |v_main_~#sum~0.offset_BEFORE_CALL_3| 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 6) 99) (not (= |v_old(#length)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_3 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_11| |v_main_~#sum~0.base_BEFORE_CALL_3|) 0) (= 12 (select |v_old(#length)_BEFORE_CALL_11| 3)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 7) 0) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 0)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 1) 114) (= (select |v_old(#valid)_BEFORE_CALL_11| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_3 0)) (= |#NULL.offset| 0) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 4) 102) (= |v_old(~N~0)_BEFORE_CALL_11| 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 1)) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 0)) (= 8 (select |v_old(#length)_BEFORE_CALL_11| 2)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 0)) (= (select |v_old(#valid)_BEFORE_CALL_11| 3) 1) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select |v_old(#length)_BEFORE_CALL_11| 1) 2) (not (= |v_old(#valid)_BEFORE_CALL_11| |v_old(#length)_BEFORE_CALL_11|)) (= (select |v_old(#valid)_BEFORE_CALL_11| 0) 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| |#StackHeapBarrier|)) (= |#NULL.base| 0))) (<= ~N~0 v_main_~i~0_BEFORE_CALL_3) (< (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_3|) |v_main_~#sum~0.offset_BEFORE_CALL_3|)))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 09:03:37,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:03:37,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:03:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-04-01 09:03:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629357328] [2023-04-01 09:03:37,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:03:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 09:03:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 09:03:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=4, NotChecked=70, Total=1406 [2023-04-01 09:03:37,087 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:37,322 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-04-01 09:03:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 09:03:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-04-01 09:03:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:37,323 INFO L225 Difference]: With dead ends: 27 [2023-04-01 09:03:37,323 INFO L226 Difference]: Without dead ends: 22 [2023-04-01 09:03:37,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=1492, Unknown=4, NotChecked=78, Total=1722 [2023-04-01 09:03:37,325 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:37,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2023-04-01 09:03:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-04-01 09:03:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-04-01 09:03:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-04-01 09:03:37,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2023-04-01 09:03:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:37,328 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-04-01 09:03:37,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-04-01 09:03:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 09:03:37,330 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:37,330 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:37,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 09:03:37,543 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-01 09:03:37,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:37,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1148394328, now seen corresponding path program 4 times [2023-04-01 09:03:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:37,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371623499] [2023-04-01 09:03:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:37,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371623499] [2023-04-01 09:03:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371623499] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:03:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207478764] [2023-04-01 09:03:37,607 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 09:03:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:03:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:37,608 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-01 09:03:37,634 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-01 09:03:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:37,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 09:03:37,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:03:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:37,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:03:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:03:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207478764] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:03:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [253632513] [2023-04-01 09:03:37,720 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 09:03:37,720 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:03:37,720 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:03:37,720 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:03:37,720 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:03:37,768 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 87 for LOIs [2023-04-01 09:03:39,019 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 124 for LOIs [2023-04-01 09:03:39,162 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 92 for LOIs [2023-04-01 09:03:39,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:03:39,181 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:03:40,661 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '935#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((|v_old(#length)_BEFORE_CALL_15| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_15| (Array Int Int)) (|v_main_~#sum~0.offset_BEFORE_CALL_4| Int) (|v_main_~#sum~0.base_BEFORE_CALL_4| Int) (|v_old(~N~0)_BEFORE_CALL_15| Int) (v_main_~a~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_BEFORE_CALL_4 Int) (v_main_~a~0.base_BEFORE_CALL_4 Int)) (and (< (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_4|) |v_main_~#sum~0.offset_BEFORE_CALL_4|)) (<= ~N~0 v_main_~i~0_BEFORE_CALL_4) (or (and (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 1)) (= |v_old(~N~0)_BEFORE_CALL_15| 0) (= v_main_~a~0.offset_BEFORE_CALL_4 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 2) 1) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 0)) (= (select |v_old(#length)_BEFORE_CALL_15| 3) 12) (= (select |v_old(#valid)_BEFORE_CALL_15| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_15| |v_old(#length)_BEFORE_CALL_15|)) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#length)_BEFORE_CALL_15| 2) 8) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 0) 48) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_4 0)) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 1) 114) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 7) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) |v_old(#length)_BEFORE_CALL_15|)) (= (select |v_old(#valid)_BEFORE_CALL_15| |v_main_~#sum~0.base_BEFORE_CALL_4|) 0) (= (select |v_old(#length)_BEFORE_CALL_15| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_15| 1) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 6) 99) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 2))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= |v_main_~#sum~0.offset_BEFORE_CALL_4| 0) (= |#NULL.offset| 0) (= 102 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 4)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 3) 50) (not (= |v_old(#length)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#valid)_BEFORE_CALL_15| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 5) 46) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 1) 0) (not (= v_main_~a~0.base_BEFORE_CALL_4 |#StackHeapBarrier|)) (= |#NULL.base| 0)) (and (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 1)) (= |v_old(~N~0)_BEFORE_CALL_15| 0) (= v_main_~a~0.offset_BEFORE_CALL_4 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 2) 1) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 0)) (= (select |v_old(#length)_BEFORE_CALL_15| 3) 12) (= (select |v_old(#valid)_BEFORE_CALL_15| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_15| |v_old(#length)_BEFORE_CALL_15|)) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#length)_BEFORE_CALL_15| 2) 8) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 0) 48) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_4 0)) (= 115 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 1) 114) (not (= v_main_~i~0_BEFORE_CALL_4 8)) (= 98 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 7) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) |v_old(#length)_BEFORE_CALL_15|)) (= (select |v_old(#valid)_BEFORE_CALL_15| |v_main_~#sum~0.base_BEFORE_CALL_4|) 0) (= (select |v_old(#length)_BEFORE_CALL_15| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_15| 1) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 6) 99) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 2))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= |v_main_~#sum~0.offset_BEFORE_CALL_4| 0) (= |#NULL.offset| 0) (= 102 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 4)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 3) 50) (not (= |v_old(#length)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#valid)_BEFORE_CALL_15| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 5) 46) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 1) 0) (not (= v_main_~a~0.base_BEFORE_CALL_4 |#StackHeapBarrier|)) (= |#NULL.base| 0))))))' at error location [2023-04-01 09:03:40,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:03:40,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:03:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-04-01 09:03:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542215482] [2023-04-01 09:03:40,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:03:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 09:03:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 09:03:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=614, Unknown=3, NotChecked=0, Total=702 [2023-04-01 09:03:40,663 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:40,744 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-04-01 09:03:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 09:03:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-04-01 09:03:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:40,745 INFO L225 Difference]: With dead ends: 32 [2023-04-01 09:03:40,745 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 09:03:40,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=707, Unknown=3, NotChecked=0, Total=812 [2023-04-01 09:03:40,746 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:40,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 09:03:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 09:03:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-01 09:03:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-04-01 09:03:40,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2023-04-01 09:03:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:40,750 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-04-01 09:03:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:03:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-04-01 09:03:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-01 09:03:40,751 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:40,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:40,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 09:03:40,957 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-01 09:03:40,958 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:40,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 754757398, now seen corresponding path program 5 times [2023-04-01 09:03:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457113138] [2023-04-01 09:03:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 09:03:40,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 09:03:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 09:03:41,034 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 09:03:41,034 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 09:03:41,035 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 09:03:41,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-01 09:03:41,038 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1] [2023-04-01 09:03:41,040 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 09:03:41,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 09:03:41 BoogieIcfgContainer [2023-04-01 09:03:41,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 09:03:41,057 INFO L158 Benchmark]: Toolchain (without parser) took 18050.42ms. Allocated memory was 281.0MB in the beginning and 722.5MB in the end (delta: 441.5MB). Free memory was 242.2MB in the beginning and 381.0MB in the end (delta: -138.8MB). Peak memory consumption was 303.7MB. Max. memory is 8.0GB. [2023-04-01 09:03:41,057 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 09:03:41,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.69ms. Allocated memory is still 281.0MB. Free memory was 242.2MB in the beginning and 231.3MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 09:03:41,057 INFO L158 Benchmark]: Boogie Preprocessor took 26.75ms. Allocated memory is still 281.0MB. Free memory was 231.3MB in the beginning and 229.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 09:03:41,057 INFO L158 Benchmark]: RCFGBuilder took 320.62ms. Allocated memory is still 281.0MB. Free memory was 229.8MB in the beginning and 214.5MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-04-01 09:03:41,058 INFO L158 Benchmark]: TraceAbstraction took 17519.62ms. Allocated memory was 281.0MB in the beginning and 722.5MB in the end (delta: 441.5MB). Free memory was 213.9MB in the beginning and 381.0MB in the end (delta: -167.1MB). Peak memory consumption was 275.4MB. Max. memory is 8.0GB. [2023-04-01 09:03:41,058 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.09ms. Allocated memory is still 180.4MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.69ms. Allocated memory is still 281.0MB. Free memory was 242.2MB in the beginning and 231.3MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.75ms. Allocated memory is still 281.0MB. Free memory was 231.3MB in the beginning and 229.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 320.62ms. Allocated memory is still 281.0MB. Free memory was 229.8MB in the beginning and 214.5MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17519.62ms. Allocated memory was 281.0MB in the beginning and 722.5MB in the end (delta: 441.5MB). Free memory was 213.9MB in the beginning and 381.0MB in the end (delta: -167.1MB). Peak memory consumption was 275.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) VAL [N=3, \old(N)=0] [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=3, \old(N)=0, \old(cond)=1] [L13] COND FALSE !(!cond) [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [N=3, \old(N)=0] [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] i=0 VAL [N=3, \old(N)=0, a={-1:0}, i=0, sum={9:0}] [L31] COND TRUE i