/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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 11:04:50,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 11:04:50,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 11:04:51,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 11:04:51,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 11:04:51,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 11:04:51,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 11:04:51,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 11:04:51,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 11:04:51,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 11:04:51,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 11:04:51,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 11:04:51,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 11:04:51,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 11:04:51,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 11:04:51,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 11:04:51,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 11:04:51,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 11:04:51,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 11:04:51,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 11:04:51,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 11:04:51,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 11:04:51,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 11:04:51,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 11:04:51,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 11:04:51,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 11:04:51,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 11:04:51,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 11:04:51,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 11:04:51,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 11:04:51,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 11:04:51,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 11:04:51,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 11:04:51,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 11:04:51,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 11:04:51,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 11:04:51,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 11:04:51,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 11:04:51,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 11:04:51,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 11:04:51,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 11:04:51,067 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 11:04:51,094 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 11:04:51,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 11:04:51,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 11:04:51,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 11:04:51,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 11:04:51,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 11:04:51,096 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 11:04:51,096 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 11:04:51,096 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 11:04:51,096 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 11:04:51,097 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 11:04:51,097 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 11:04:51,097 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 11:04:51,097 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 11:04:51,097 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 11:04:51,098 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 11:04:51,098 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 11:04:51,098 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 11:04:51,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 11:04:51,098 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 11:04:51,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 11:04:51,100 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 11:04:51,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 11:04:51,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 11:04:51,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 11:04:51,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:04:51,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 11:04:51,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 11:04:51,101 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 11:04:51,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:04:51,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:04:51,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:04:51,406 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:04:51,406 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:04:51,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-01 11:04:52,604 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:04:52,796 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:04:52,797 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-01 11:04:52,803 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cb58936/e0a5ff18958a42059140c95e20232bf5/FLAG58754fc54 [2023-04-01 11:04:52,816 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cb58936/e0a5ff18958a42059140c95e20232bf5 [2023-04-01 11:04:52,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:04:52,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:04:52,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:04:52,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:04:52,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:04:52,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:04:52" (1/1) ... [2023-04-01 11:04:52,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dce689b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:52, skipping insertion in model container [2023-04-01 11:04:52,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:04:52" (1/1) ... [2023-04-01 11:04:52,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:04:52,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:04:52,956 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-04-01 11:04:52,965 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-04-01 11:04:52,970 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-04-01 11:04:52,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:04:52,979 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:04:52,991 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-04-01 11:04:52,995 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-04-01 11:04:52,997 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-04-01 11:04:53,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:04:53,011 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:04:53,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53 WrapperNode [2023-04-01 11:04:53,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:04:53,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:04:53,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:04:53,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:04:53,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,038 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:04:53,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:04:53,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:04:53,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:04:53,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (1/1) ... [2023-04-01 11:04:53,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:04:53,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:04:53,070 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 11:04:53,072 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 11:04:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:04:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:04:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:04:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 11:04:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:04:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 11:04:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:04:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:04:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:04:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:04:53,165 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:04:53,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:04:53,330 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:04:53,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:04:53,372 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 11:04:53,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:04:53 BoogieIcfgContainer [2023-04-01 11:04:53,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:04:53,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:04:53,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:04:53,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:04:53,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:04:52" (1/3) ... [2023-04-01 11:04:53,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2652287b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:04:53, skipping insertion in model container [2023-04-01 11:04:53,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:04:53" (2/3) ... [2023-04-01 11:04:53,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2652287b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:04:53, skipping insertion in model container [2023-04-01 11:04:53,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:04:53" (3/3) ... [2023-04-01 11:04:53,397 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2023-04-01 11:04:53,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:04:53,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-04-01 11:04:53,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:04:53,472 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;@4465424d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:04:53,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-04-01 11:04:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 31 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:04:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 11:04:53,482 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:04:53,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:04:53,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:04:53,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:04:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2143969391, now seen corresponding path program 1 times [2023-04-01 11:04:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:04:53,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783887288] [2023-04-01 11:04:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:04:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:53,790 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 11:04:53,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:04:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783887288] [2023-04-01 11:04:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783887288] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:04:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:04:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 11:04:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539873815] [2023-04-01 11:04:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:04:53,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 11:04:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:04:53,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 11:04:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 11:04:53,835 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 31 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:04:53,873 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2023-04-01 11:04:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 11:04:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-04-01 11:04:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:04:53,896 INFO L225 Difference]: With dead ends: 67 [2023-04-01 11:04:53,897 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 11:04:53,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 11:04:53,902 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:04:53,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:04:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 11:04:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-04-01 11:04:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-04-01 11:04:53,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 13 [2023-04-01 11:04:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:04:53,948 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-04-01 11:04:53,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-04-01 11:04:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 11:04:53,950 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:04:53,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:04:53,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 11:04:53,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:04:53,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:04:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash 245210339, now seen corresponding path program 1 times [2023-04-01 11:04:53,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:04:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215683093] [2023-04-01 11:04:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:04:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:54,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:04:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215683093] [2023-04-01 11:04:54,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215683093] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:04:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853196447] [2023-04-01 11:04:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:54,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:04:54,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:04:54,133 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 11:04:54,142 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 11:04:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:54,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 11:04:54,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:04:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:54,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:04:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853196447] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:04:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [41487916] [2023-04-01 11:04:54,397 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-04-01 11:04:54,398 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:04:54,400 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:04:54,404 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:04:54,405 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:04:54,639 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2023-04-01 11:04:55,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-01 11:04:55,129 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:04:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [41487916] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:04:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:04:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 16 [2023-04-01 11:04:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925098643] [2023-04-01 11:04:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:04:56,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 11:04:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:04:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 11:04:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-04-01 11:04:56,186 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:04:57,413 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-04-01 11:04:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 11:04:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-01 11:04:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:04:57,414 INFO L225 Difference]: With dead ends: 52 [2023-04-01 11:04:57,414 INFO L226 Difference]: Without dead ends: 31 [2023-04-01 11:04:57,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-04-01 11:04:57,416 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:04:57,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 72 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:04:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-01 11:04:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-04-01 11:04:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-04-01 11:04:57,425 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 14 [2023-04-01 11:04:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:04:57,425 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-04-01 11:04:57,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-04-01 11:04:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 11:04:57,426 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:04:57,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:04:57,437 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 11:04:57,627 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 11:04:57,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:04:57,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:04:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1202278993, now seen corresponding path program 1 times [2023-04-01 11:04:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:04:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760361098] [2023-04-01 11:04:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:04:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:04:57,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:04:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760361098] [2023-04-01 11:04:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760361098] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:04:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:04:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 11:04:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665708638] [2023-04-01 11:04:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:04:57,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 11:04:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:04:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 11:04:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 11:04:57,720 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:04:57,745 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-04-01 11:04:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 11:04:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-01 11:04:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:04:57,747 INFO L225 Difference]: With dead ends: 32 [2023-04-01 11:04:57,747 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 11:04:57,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 11:04:57,748 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:04:57,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:04:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 11:04:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-04-01 11:04:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-01 11:04:57,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2023-04-01 11:04:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:04:57,756 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-01 11:04:57,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:04:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-01 11:04:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 11:04:57,757 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:04:57,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:04:57,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 11:04:57,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:04:57,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:04:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 152580976, now seen corresponding path program 1 times [2023-04-01 11:04:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:04:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214350880] [2023-04-01 11:04:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:04:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:57,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:04:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214350880] [2023-04-01 11:04:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214350880] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:04:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558262531] [2023-04-01 11:04:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:04:57,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:04:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:04:57,896 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 11:04:57,898 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 11:04:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:04:57,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 11:04:57,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:04:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:57,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:04:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:04:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558262531] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:04:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882976084] [2023-04-01 11:04:57,987 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:04:57,987 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:04:57,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:04:57,987 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:04:57,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:04:58,049 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2023-04-01 11:04:59,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-01 11:04:59,705 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:05:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [882976084] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:05:02,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:05:02,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4, 4, 4] total 23 [2023-04-01 11:05:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845766374] [2023-04-01 11:05:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:05:02,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 11:05:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:05:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 11:05:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-04-01 11:05:02,142 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:05:03,710 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-04-01 11:05:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 11:05:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-01 11:05:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:05:03,713 INFO L225 Difference]: With dead ends: 56 [2023-04-01 11:05:03,713 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 11:05:03,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2023-04-01 11:05:03,714 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 11:05:03,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 11:05:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 11:05:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-04-01 11:05:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-04-01 11:05:03,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2023-04-01 11:05:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:05:03,744 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-04-01 11:05:03,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-04-01 11:05:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-01 11:05:03,746 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:05:03,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:05:03,755 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 11:05:03,952 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,SelfDestructingSolverStorable3 [2023-04-01 11:05:03,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:05:03,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:05:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash -216779000, now seen corresponding path program 1 times [2023-04-01 11:05:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:05:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459187063] [2023-04-01 11:05:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:05:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:05:04,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:05:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459187063] [2023-04-01 11:05:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459187063] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:05:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:05:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 11:05:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234486103] [2023-04-01 11:05:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:05:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 11:05:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:05:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 11:05:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 11:05:04,058 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:05:04,111 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-04-01 11:05:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 11:05:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-01 11:05:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:05:04,113 INFO L225 Difference]: With dead ends: 54 [2023-04-01 11:05:04,113 INFO L226 Difference]: Without dead ends: 52 [2023-04-01 11:05:04,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-04-01 11:05:04,115 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:05:04,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:05:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-01 11:05:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2023-04-01 11:05:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-04-01 11:05:04,131 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2023-04-01 11:05:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:05:04,131 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-04-01 11:05:04,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-04-01 11:05:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 11:05:04,133 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:05:04,133 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:05:04,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 11:05:04,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:05:04,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:05:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash 601518218, now seen corresponding path program 1 times [2023-04-01 11:05:04,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:05:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658746972] [2023-04-01 11:05:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:05:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 11:05:04,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:05:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658746972] [2023-04-01 11:05:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658746972] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:05:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340714222] [2023-04-01 11:05:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:05:04,216 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 11:05:04,239 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 11:05:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:04,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 11:05:04,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:05:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:05:04,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:05:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:05:04,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340714222] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:05:04,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183433796] [2023-04-01 11:05:04,356 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:05:04,356 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:05:04,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:05:04,356 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:05:04,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:05:04,414 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2023-04-01 11:05:07,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-01 11:05:07,850 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:05:10,500 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1073#(and (not (= |#StackHeapBarrier| |main_~#main__array~0.base|)) (= (select |old(#valid)| 3) 1) (= main_~__VERIFIER_assert__cond~2 0) (not (= 100000 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (= main_~main____CPAchecker_TMP_0~0 1) (= (select |old(#valid)| 1) 1) (= (select |old(#length)| 1) 2) (= (select |old(#valid)| 0) 0) (= ~__tmp_155_0~0 1) (= main_~__tmp_3~0 0) (or (and (<= (mod main_~main__index2~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296))) (< 2147483647 (mod main_~main__index1~0 4294967296))) (and (<= (mod main_~main__index1~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index1~0 4294967296) 4)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (* (mod main_~main__index2~0 4294967296) 4)) 4294967296)))) (and (< 2147483647 (mod main_~main__index2~0 4294967296)) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) (* (mod main_~main__index2~0 4294967296) 4))) 4294967296))))) (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (= |old(~__tmp_155_0~0)| 0) (not (= |#StackHeapBarrier| 0)) (= ~__return_136~0 0) (not (= |main_~#main__array~0.base| 0)) (= (select (select |old(#memory_int)| 1) 0) 48) (= (select |old(#length)| 3) 12) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= (select |old(#length)| 2) 45) (= |#NULL.offset| 0) (= main_~main__loop_entered~0 1) (= (select (select |old(#memory_int)| 1) 1) 0) (= main_~__VERIFIER_assert__cond~0 1) (= (select |old(#valid)| 2) 1) (= ~__return_main~0 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 1) (= |#NULL.base| 0))' at error location [2023-04-01 11:05:10,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:05:10,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:05:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-04-01 11:05:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437195305] [2023-04-01 11:05:10,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 11:05:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 11:05:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:05:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 11:05:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2023-04-01 11:05:10,502 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:05:10,612 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-04-01 11:05:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 11:05:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-04-01 11:05:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:05:10,613 INFO L225 Difference]: With dead ends: 73 [2023-04-01 11:05:10,613 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 11:05:10,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-04-01 11:05:10,614 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:05:10,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:05:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 11:05:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-04-01 11:05:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-04-01 11:05:10,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 23 [2023-04-01 11:05:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:05:10,623 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-04-01 11:05:10,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-04-01 11:05:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 11:05:10,624 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:05:10,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:05:10,633 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 11:05:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:10,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:05:10,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:05:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1165568093, now seen corresponding path program 1 times [2023-04-01 11:05:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:05:10,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22537261] [2023-04-01 11:05:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:05:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:05:10,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:05:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22537261] [2023-04-01 11:05:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22537261] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:05:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709651228] [2023-04-01 11:05:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:05:10,932 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 11:05:10,955 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 11:05:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:11,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 11:05:11,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:05:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:05:11,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:05:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:05:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709651228] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:05:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72969811] [2023-04-01 11:05:11,079 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 11:05:11,079 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:05:11,080 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:05:11,080 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:05:11,080 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:05:11,126 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2023-04-01 11:05:12,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-01 11:05:12,241 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:05:15,735 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1426#(and (= (+ main_~main__index2~0 1) main_~main____CPAchecker_TMP_2~0) (= main_~__VERIFIER_assert__cond~2 0) (or (and (< 2147483647 (mod main_~main__index2~0 4294967296)) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) |main_~#main__array~0.offset| (* (mod main_~main__index2~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) |main_~#main__array~0.offset| (* (mod main_~main__index1~0 4294967296) 4))) 4294967296)))) (and (<= (mod main_~main__index2~0 4294967296) 2147483647) (< 2147483647 (mod main_~main__index1~0 4294967296)) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (- 17179869184) |main_~#main__array~0.offset| (* (mod main_~main__index1~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ |main_~#main__array~0.offset| (* (mod main_~main__index2~0 4294967296) 4))) 4294967296)))) (and (<= (mod main_~main__index1~0 4294967296) 2147483647) (not (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ |main_~#main__array~0.offset| (* (mod main_~main__index2~0 4294967296) 4))) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ |main_~#main__array~0.offset| (* (mod main_~main__index1~0 4294967296) 4))) 4294967296))))) (= main_~__tmp_3~0 0) (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (= main_~main__loop_entered~0 1) (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)))' at error location [2023-04-01 11:05:15,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:05:15,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:05:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-04-01 11:05:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120018148] [2023-04-01 11:05:15,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 11:05:15,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 11:05:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:05:15,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 11:05:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2023-04-01 11:05:15,737 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:05:15,805 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-04-01 11:05:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 11:05:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-04-01 11:05:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:05:15,809 INFO L225 Difference]: With dead ends: 70 [2023-04-01 11:05:15,809 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 11:05:15,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2023-04-01 11:05:15,810 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:05:15,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:05:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 11:05:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-01 11:05:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-04-01 11:05:15,819 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2023-04-01 11:05:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:05:15,819 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-04-01 11:05:15,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-04-01 11:05:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-01 11:05:15,820 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:05:15,820 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:05:15,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 11:05:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:16,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:05:16,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:05:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash 100967773, now seen corresponding path program 2 times [2023-04-01 11:05:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:05:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166854527] [2023-04-01 11:05:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:05:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:05:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:05:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:05:16,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:05:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166854527] [2023-04-01 11:05:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166854527] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:05:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979558430] [2023-04-01 11:05:16,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 11:05:16,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:05:16,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:05:16,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 11:05:16,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 11:05:16,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 11:05:16,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2023-04-01 11:05:16,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:05:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:05:17,678 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 11:05:17,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:05:17,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 11:05:17,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:05:17,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 11:05:17,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 986 treesize of output 568 [2023-04-01 11:05:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 11:05:18,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 11:05:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979558430] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:05:18,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 11:05:18,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2023-04-01 11:05:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472981972] [2023-04-01 11:05:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:05:18,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 11:05:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:05:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 11:05:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2023-04-01 11:05:18,518 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:05:19,624 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-04-01 11:05:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 11:05:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-04-01 11:05:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:05:19,626 INFO L225 Difference]: With dead ends: 55 [2023-04-01 11:05:19,626 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 11:05:19,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 11:05:19,627 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:05:19,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:05:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 11:05:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 11:05:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 11:05:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 11:05:19,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-04-01 11:05:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:05:19,629 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 11:05:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:05:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 11:05:19,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 11:05:19,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-04-01 11:05:19,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-04-01 11:05:19,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-04-01 11:05:19,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 11:05:19,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:05:19,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 11:05:22,206 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-01 11:05:22,206 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-01 11:05:22,206 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 6 8) no Hoare annotation was computed. [2023-04-01 11:05:22,207 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-04-01 11:05:22,207 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-04-01 11:05:22,207 INFO L895 garLoopResultBuilder]: At program point L89(lines 64 97) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,207 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 14 172) no Hoare annotation was computed. [2023-04-01 11:05:22,207 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse6 (mod main_~main__index2~0 4294967296))) (let ((.cse0 (< .cse6 100000)) (.cse1 (= (select |#valid| 3) 1)) (.cse2 (< (mod main_~main__index1~0 4294967296) .cse6)) (.cse3 (= main_~__VERIFIER_assert__cond~0 1)) (.cse4 (= |main_~#main__array~0.offset| 0)) (.cse5 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and .cse0 (not (= |#StackHeapBarrier| |main_~#main__array~0.base|)) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) .cse1 .cse2 (not (= |main_~#main__array~0.base| 0)) (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) .cse3 .cse4 (= main_~__tmp_1~0 1)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (and .cse0 .cse1 .cse2 (= main_~main____CPAchecker_TMP_0~1 1) (= main_~__VERIFIER_assert__cond~1 1) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) .cse3 .cse4) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse5 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse5 1) 0)) (not (= (select |old(#length)| 2) 45))))) [2023-04-01 11:05:22,207 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2023-04-01 11:05:22,207 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-04-01 11:05:22,208 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-04-01 11:05:22,208 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 105 131) the Hoare annotation is: (let ((.cse0 (+ main_~main__index2~0 1))) (let ((.cse7 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse6 (mod .cse0 4294967296))) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|)) (.cse3 (< .cse7 .cse6)) (.cse5 (= |main_~#main__array~0.offset| 0)) (.cse4 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse1 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (and (not (= |#StackHeapBarrier| |main_~#main__array~0.base|)) (= .cse0 main_~main____CPAchecker_TMP_2~0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) (not (= |main_~#main__array~0.base| 0)) (<= 100000 (mod main_~i~0 4294967296)) (< .cse1 100000) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= (mod (select .cse2 (* 4 (mod main_~main____CPAchecker_TMP_1~0 4294967296))) 4294967296) (mod (select .cse2 (* .cse1 4)) 4294967296)) (= main_~main__loop_entered~0 1) .cse3 .cse4 (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) .cse5 (= main_~__tmp_1~0 1))) (not (= |old(~__tmp_155_0~0)| 0)) (and (= (select |#valid| 3) 1) (< (mod (+ 4294967294 main_~main__index1~0) 4294967296) 100000) (< .cse6 100000) (= (mod (select .cse2 (* .cse6 4)) 4294967296) (mod (select .cse2 (* .cse7 4)) 4294967296)) .cse3 .cse4 .cse5) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) .cse4) (not (= (select .cse8 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (not (= (select |old(#length)| 2) 45)))))) [2023-04-01 11:05:22,208 INFO L895 garLoopResultBuilder]: At program point $Ultimate##30(lines 102 136) the Hoare annotation is: (let ((.cse15 (+ main_~main__index2~0 1))) (let ((.cse1 (mod main_~main__index1~0 4294967296)) (.cse12 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse10 (mod .cse15 4294967296))) (let ((.cse9 (select |old(#memory_int)| 1)) (.cse2 (= (select |#valid| 3) 1)) (.cse0 (not (= |#StackHeapBarrier| |main_~#main__array~0.base|))) (.cse3 (not (= |main_~#main__array~0.base| 0))) (.cse4 (<= 100000 (mod main_~i~0 4294967296))) (.cse5 (= (select |old(#valid)| |main_~#main__array~0.base|) 0)) (.cse11 (select |#memory_int| |main_~#main__array~0.base|)) (.cse13 (< .cse12 .cse10)) (.cse7 (<= (mod main_~main__index2~0 4294967296) .cse1)) (.cse14 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (= |main_~#main__array~0.offset| 0))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (let ((.cse6 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) .cse0 (< .cse1 100000) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) .cse2 .cse3 (= (select |#valid| 1) 1) .cse4 (= main_~main__loop_entered~0 0) .cse5 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse6 0) 48) .cse7 (= (select .cse6 1) 0) .cse8)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse9 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse9 1) 0)) (and (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2 (< (mod (+ 4294967294 main_~main__index1~0) 4294967296) 100000) (< .cse10 100000) (= (mod (select .cse11 (* .cse10 4)) 4294967296) (mod (select .cse11 (* .cse12 4)) 4294967296)) .cse13 .cse14 .cse8) (let ((.cse16 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (and .cse0 (= .cse15 main_~main____CPAchecker_TMP_2~0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) .cse3 .cse4 (< .cse16 100000) .cse5 (= (mod (select .cse11 (* 4 (mod main_~main____CPAchecker_TMP_1~0 4294967296))) 4294967296) (mod (select .cse11 (* .cse16 4)) 4294967296)) (= main_~main__loop_entered~0 1) .cse13 .cse7 .cse14 (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) .cse8 (= main_~__tmp_1~0 1))) (not (= (select |old(#length)| 2) 45)))))) [2023-04-01 11:05:22,208 INFO L895 garLoopResultBuilder]: At program point L69(lines 66 92) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (mod main_~main__index2~0 4294967296))) (and (< .cse0 100000) (= (select |#valid| 3) 1) (< (mod main_~main__index1~0 4294967296) .cse0) (= main_~main____CPAchecker_TMP_0~1 1) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (= main_~__VERIFIER_assert__cond~0 1) (= |main_~#main__array~0.offset| 0))) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 166) no Hoare annotation was computed. [2023-04-01 11:05:22,209 INFO L895 garLoopResultBuilder]: At program point L148(lines 33 156) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,209 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (not (= |#StackHeapBarrier| |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (not (= |main_~#main__array~0.base| 0)) (= (select |#valid| 1) 1) (= main_~main__loop_entered~0 0) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= |main_~#main__array~0.offset| 0))) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-04-01 11:05:22,209 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 171) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 124) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 14 172) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-04-01 11:05:22,210 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 172) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= ~__tmp_155_0~0 0) (= |old(#valid)| |#valid|)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,210 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) the Hoare annotation is: (let ((.cse2 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (let ((.cse0 (mod main_~main__index2~0 4294967296)) (.cse1 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (< .cse0 100000) (= 45 (select |#length| 2)) (not (= |#StackHeapBarrier| |main_~#main__array~0.base|)) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< (mod main_~main__index1~0 4294967296) .cse0) (not (= |main_~#main__array~0.base| 0)) (= (select |#valid| 1) 1) (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (= (select .cse1 1) 0) (= |main_~#main__array~0.offset| 0))) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse2 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse2 1) 0)) (not (= (select |old(#length)| 2) 45)))) [2023-04-01 11:05:22,211 INFO L902 garLoopResultBuilder]: At program point L129(lines 102 136) the Hoare annotation is: true [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 161) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_136~0)| ~__return_136~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~__return_136~0 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~__return_main~0 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-01 11:05:22,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 11:05:22,211 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 11:05:22,214 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-04-01 11:05:22,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 11:05:22,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 11:05:22 BoogieIcfgContainer [2023-04-01 11:05:22,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 11:05:22,243 INFO L158 Benchmark]: Toolchain (without parser) took 29422.43ms. Allocated memory was 251.7MB in the beginning and 524.3MB in the end (delta: 272.6MB). Free memory was 208.3MB in the beginning and 280.4MB in the end (delta: -72.1MB). Peak memory consumption was 307.9MB. Max. memory is 8.0GB. [2023-04-01 11:05:22,243 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 11:05:22,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.77ms. Allocated memory is still 251.7MB. Free memory was 208.3MB in the beginning and 196.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-01 11:05:22,243 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 251.7MB. Free memory was 196.2MB in the beginning and 194.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 11:05:22,243 INFO L158 Benchmark]: RCFGBuilder took 332.01ms. Allocated memory is still 251.7MB. Free memory was 194.7MB in the beginning and 179.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-04-01 11:05:22,244 INFO L158 Benchmark]: TraceAbstraction took 28865.99ms. Allocated memory was 251.7MB in the beginning and 524.3MB in the end (delta: 272.6MB). Free memory was 178.4MB in the beginning and 280.4MB in the end (delta: -102.0MB). Peak memory consumption was 277.5MB. Max. memory is 8.0GB. [2023-04-01 11:05:22,245 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.11ms. Allocated memory is still 188.7MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.77ms. Allocated memory is still 251.7MB. Free memory was 208.3MB in the beginning and 196.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 251.7MB. Free memory was 196.2MB in the beginning and 194.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 332.01ms. Allocated memory is still 251.7MB. Free memory was 194.7MB in the beginning and 179.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 28865.99ms. Allocated memory was 251.7MB in the beginning and 524.3MB in the end (delta: 272.6MB). Free memory was 178.4MB in the beginning and 280.4MB in the end (delta: -102.0MB). Peak memory consumption was 277.5MB. 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 - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 77]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 194 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 32 NumberOfFragments, 1545 HoareAnnotationTreeSize, 13 FomulaSimplifications, 785 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1567 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 290 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 13 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 44/83 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 2.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 31, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 33, TOOLS_POST_TIME: 1.7s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 1.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 98, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.4s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 31, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 295, DAG_COMPRESSION_RETAINED_NODES: 102, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || (((((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && !(unknown-#StackHeapBarrier-unknown == main__array)) && main__index1 % 4294967296 < 100000) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && !(main__array == 0)) && \valid[1] == 1) && 100000 <= i % 4294967296) && main__loop_entered == 0) && \old(\valid)[main__array] == 0) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && main__index2 % 4294967296 <= main__index1 % 4294967296) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || (((((((!(__VERIFIER_assert__cond == 0) && \valid[3] == 1) && (4294967294 + main__index1) % 4294967296 < 100000) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || (((((((((((((((!(unknown-#StackHeapBarrier-unknown == main__array) && main__index2 + 1 == main____CPAchecker_TMP_2) && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && !(main__array == 0)) && 100000 <= i % 4294967296) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && \old(\valid)[main__array] == 0) && unknown-#memory_int-unknown[main__array][4 * (main____CPAchecker_TMP_1 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main__loop_entered == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 % 4294967296 <= main__index1 % 4294967296) && __VERIFIER_assert__cond == 1) && main__index1 == main____CPAchecker_TMP_1 + 1) && main__array == 0) && __tmp_1 == 1)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || ((((((((((((((((((unknown-#length-unknown[3] == 12 && main__index2 % 4294967296 < 100000) && 45 == unknown-#length-unknown[2]) && !(unknown-#StackHeapBarrier-unknown == main__array)) && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && !(main__array == 0)) && \valid[1] == 1) && 100000 <= i % 4294967296) && main__loop_entered == 0) && \old(\valid)[main__array] == 0) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || ((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && !(unknown-#StackHeapBarrier-unknown == main__array)) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && !(main__array == 0)) && \valid[1] == 1) && main__loop_entered == 0) && \old(\valid)[main__array] == 0) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((main__index2 % 4294967296 < 100000 && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((((((!(unknown-#StackHeapBarrier-unknown == main__array) && main__index2 + 1 == main____CPAchecker_TMP_2) && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && !(main__array == 0)) && 100000 <= i % 4294967296) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && \old(\valid)[main__array] == 0) && unknown-#memory_int-unknown[main__array][4 * (main____CPAchecker_TMP_1 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main__loop_entered == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__index1 == main____CPAchecker_TMP_1 + 1) && main__array == 0) && __tmp_1 == 1)) || !(\old(__tmp_155_0) == 0)) || ((((((\valid[3] == 1 && (4294967294 + main__index1) % 4294967296 < 100000) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || (main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((((main__index2 % 4294967296 < 100000 && !(unknown-#StackHeapBarrier-unknown == main__array)) && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && !(main__array == 0)) && 100000 <= i % 4294967296) && main__loop_entered == 0) && \old(\valid)[main__array] == 0) && __VERIFIER_assert__cond == 1) && main__array == 0) && __tmp_1 == 1)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || !(\old(\valid)[3] == 1)) || !(#NULL == 0)) || (((((((main__index2 % 4294967296 < 100000 && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(unknown-#length-unknown)[2] == 45) RESULT: Ultimate proved your program to be correct! [2023-04-01 11:05:22,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...