/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 22:07:02,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 22:07:02,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 22:07:02,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 22:07:02,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 22:07:02,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 22:07:02,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 22:07:02,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 22:07:02,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 22:07:02,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 22:07:02,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 22:07:02,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 22:07:02,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 22:07:02,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 22:07:02,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 22:07:02,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 22:07:02,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 22:07:02,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 22:07:02,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 22:07:02,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 22:07:02,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 22:07:02,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 22:07:02,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 22:07:02,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 22:07:02,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 22:07:02,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 22:07:02,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 22:07:02,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 22:07:02,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 22:07:02,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 22:07:02,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 22:07:02,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 22:07:02,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 22:07:02,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 22:07:02,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 22:07:02,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 22:07:02,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 22:07:02,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 22:07:02,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 22:07:02,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 22:07:02,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 22:07:02,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 22:07:02,480 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 22:07:02,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 22:07:02,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 22:07:02,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 22:07:02,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 22:07:02,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 22:07:02,481 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 22:07:02,481 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 22:07:02,481 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 22:07:02,481 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 22:07:02,482 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 22:07:02,482 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 22:07:02,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 22:07:02,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 22:07:02,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:07:02,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 22:07:02,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 22:07:02,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 22:07:02,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 22:07:02,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 22:07:02,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 22:07:02,674 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 22:07:02,675 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 22:07:02,676 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+lhb-reducer.c [2023-04-02 22:07:03,631 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 22:07:03,810 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 22:07:03,811 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2023-04-02 22:07:03,818 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8cf8925/86dbae0138984a1da64a53ecf28331ba/FLAG83640d4cc [2023-04-02 22:07:03,840 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8cf8925/86dbae0138984a1da64a53ecf28331ba [2023-04-02 22:07:03,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 22:07:03,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 22:07:03,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 22:07:03,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 22:07:03,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 22:07:03,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:07:03" (1/1) ... [2023-04-02 22:07:03,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f69812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:03, skipping insertion in model container [2023-04-02 22:07:03,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:07:03" (1/1) ... [2023-04-02 22:07:03,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 22:07:03,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 22:07:04,001 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+lhb-reducer.c[1215,1228] [2023-04-02 22:07:04,014 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+lhb-reducer.c[1969,1982] [2023-04-02 22:07:04,018 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+lhb-reducer.c[2490,2503] [2023-04-02 22:07:04,023 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+lhb-reducer.c[3282,3295] [2023-04-02 22:07:04,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:07:04,034 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 22:07:04,051 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+lhb-reducer.c[1215,1228] [2023-04-02 22:07:04,062 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+lhb-reducer.c[1969,1982] [2023-04-02 22:07:04,064 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+lhb-reducer.c[2490,2503] [2023-04-02 22:07:04,067 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+lhb-reducer.c[3282,3295] [2023-04-02 22:07:04,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:07:04,082 INFO L208 MainTranslator]: Completed translation [2023-04-02 22:07:04,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04 WrapperNode [2023-04-02 22:07:04,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 22:07:04,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 22:07:04,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 22:07:04,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 22:07:04,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 22:07:04,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 22:07:04,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 22:07:04,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 22:07:04,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (1/1) ... [2023-04-02 22:07:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:07:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:04,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 22:07:04,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 22:07:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 22:07:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 22:07:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 22:07:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 22:07:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 22:07:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 22:07:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 22:07:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 22:07:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 22:07:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 22:07:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 22:07:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 22:07:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 22:07:04,262 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 22:07:04,264 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 22:07:04,492 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 22:07:04,528 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 22:07:04,529 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 22:07:04,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:07:04 BoogieIcfgContainer [2023-04-02 22:07:04,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 22:07:04,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 22:07:04,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 22:07:04,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 22:07:04,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 10:07:03" (1/3) ... [2023-04-02 22:07:04,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cebeaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:07:04, skipping insertion in model container [2023-04-02 22:07:04,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:07:04" (2/3) ... [2023-04-02 22:07:04,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cebeaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:07:04, skipping insertion in model container [2023-04-02 22:07:04,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:07:04" (3/3) ... [2023-04-02 22:07:04,542 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2023-04-02 22:07:04,556 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 22:07:04,556 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-04-02 22:07:04,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 22:07:04,592 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;@17bdc366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 22:07:04,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-04-02 22:07:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 37 states have internal predecessors, (55), 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-02 22:07:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 22:07:04,600 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:04,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:04,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:04,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 216098912, now seen corresponding path program 1 times [2023-04-02 22:07:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:04,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385503112] [2023-04-02 22:07:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:04,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385503112] [2023-04-02 22:07:04,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385503112] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 22:07:04,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365214587] [2023-04-02 22:07:04,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:04,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 22:07:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:04,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 22:07:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:04,848 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 37 states have internal predecessors, (55), 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-02 22:07:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:04,881 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2023-04-02 22:07:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 22:07:04,885 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-02 22:07:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:04,890 INFO L225 Difference]: With dead ends: 79 [2023-04-02 22:07:04,890 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 22:07:04,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:04,894 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 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-02 22:07:04,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 22:07:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-04-02 22:07:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 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-02 22:07:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-04-02 22:07:04,920 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2023-04-02 22:07:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:04,921 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-04-02 22:07:04,921 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-02 22:07:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-04-02 22:07:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 22:07:04,922 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:04,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:04,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 22:07:04,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:04,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash 929584483, now seen corresponding path program 1 times [2023-04-02 22:07:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:04,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088645995] [2023-04-02 22:07:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:04,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:05,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088645995] [2023-04-02 22:07:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088645995] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:05,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051966654] [2023-04-02 22:07:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:05,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:05,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:05,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 22:07:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 22:07:05,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:05,173 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-02 22:07:05,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:07:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051966654] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:07:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-04-02 22:07:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915166957] [2023-04-02 22:07:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:05,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 22:07:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 22:07:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:07:05,176 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02 22:07:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:05,200 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-04-02 22:07:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 22:07:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2023-04-02 22:07:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:05,201 INFO L225 Difference]: With dead ends: 45 [2023-04-02 22:07:05,201 INFO L226 Difference]: Without dead ends: 35 [2023-04-02 22:07:05,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:07:05,202 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 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-02 22:07:05,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-02 22:07:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-04-02 22:07:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 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-02 22:07:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-04-02 22:07:05,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 14 [2023-04-02 22:07:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:05,207 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-04-02 22:07:05,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02 22:07:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-04-02 22:07:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:07:05,207 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:05,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:05,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:05,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:05,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash 887722097, now seen corresponding path program 1 times [2023-04-02 22:07:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:05,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001272800] [2023-04-02 22:07:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,506 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-02 22:07:05,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001272800] [2023-04-02 22:07:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001272800] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:05,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:07:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657217397] [2023-04-02 22:07:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:05,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:07:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:05,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:07:05,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:07:05,512 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-02 22:07:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:05,554 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-04-02 22:07:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:07:05,556 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-02 22:07:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:05,556 INFO L225 Difference]: With dead ends: 54 [2023-04-02 22:07:05,556 INFO L226 Difference]: Without dead ends: 52 [2023-04-02 22:07:05,559 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-02 22:07:05,560 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:05,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-02 22:07:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2023-04-02 22:07:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 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-02 22:07:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-04-02 22:07:05,565 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2023-04-02 22:07:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:05,565 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-04-02 22:07:05,565 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-02 22:07:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-04-02 22:07:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:07:05,565 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:05,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:05,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 22:07:05,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:05,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 952398358, now seen corresponding path program 1 times [2023-04-02 22:07:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575995393] [2023-04-02 22:07:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,593 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-02 22:07:05,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575995393] [2023-04-02 22:07:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575995393] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:05,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:05,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 22:07:05,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809337056] [2023-04-02 22:07:05,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:05,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 22:07:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 22:07:05,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:05,595 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-02 22:07:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:05,618 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-04-02 22:07:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 22:07:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-02 22:07:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:05,619 INFO L225 Difference]: With dead ends: 63 [2023-04-02 22:07:05,619 INFO L226 Difference]: Without dead ends: 42 [2023-04-02 22:07:05,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:05,620 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:05,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-02 22:07:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2023-04-02 22:07:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 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-02 22:07:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-04-02 22:07:05,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 15 [2023-04-02 22:07:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:05,625 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-04-02 22:07:05,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-02 22:07:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-04-02 22:07:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-02 22:07:05,626 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:05,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:05,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 22:07:05,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:05,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1807730394, now seen corresponding path program 1 times [2023-04-02 22:07:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393928623] [2023-04-02 22:07:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,648 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-02 22:07:05,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393928623] [2023-04-02 22:07:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393928623] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 22:07:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158813271] [2023-04-02 22:07:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 22:07:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 22:07:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:05,650 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02 22:07:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:05,673 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-04-02 22:07:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 22:07:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2023-04-02 22:07:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:05,674 INFO L225 Difference]: With dead ends: 57 [2023-04-02 22:07:05,674 INFO L226 Difference]: Without dead ends: 36 [2023-04-02 22:07:05,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 22:07:05,675 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:05,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-02 22:07:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-04-02 22:07:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-02 22:07:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-04-02 22:07:05,679 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2023-04-02 22:07:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:05,679 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-04-02 22:07:05,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02 22:07:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-04-02 22:07:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 22:07:05,679 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:05,680 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-02 22:07:05,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 22:07:05,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:05,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1702420816, now seen corresponding path program 1 times [2023-04-02 22:07:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676398955] [2023-04-02 22:07:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:05,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:05,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676398955] [2023-04-02 22:07:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676398955] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:05,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174623909] [2023-04-02 22:07:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:05,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:05,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:05,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:05,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 22:07:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:05,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 22:07:05,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:05,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:07:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174623909] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2087094028] [2023-04-02 22:07:05,860 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:07:05,860 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:05,862 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:05,865 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:05,866 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:05,930 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:07,365 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:07,372 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2087094028] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:08,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:08,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4, 4, 4] total 23 [2023-04-02 22:07:08,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263216493] [2023-04-02 22:07:08,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:08,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 22:07:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:08,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 22:07:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-04-02 22:07:08,748 INFO L87 Difference]: Start difference. First operand 30 states and 34 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-02 22:07:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:09,839 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2023-04-02 22:07:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 22:07:09,839 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-02 22:07:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:09,840 INFO L225 Difference]: With dead ends: 59 [2023-04-02 22:07:09,840 INFO L226 Difference]: Without dead ends: 43 [2023-04-02 22:07:09,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2023-04-02 22:07:09,841 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:09,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 69 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:07:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-04-02 22:07:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2023-04-02 22:07:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 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-02 22:07:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-04-02 22:07:09,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 21 [2023-04-02 22:07:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:09,846 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-04-02 22:07:09,846 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-02 22:07:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-04-02 22:07:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 22:07:09,847 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:09,847 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-02 22:07:09,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:10,053 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,SelfDestructingSolverStorable5 [2023-04-02 22:07:10,054 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:10,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 584570088, now seen corresponding path program 1 times [2023-04-02 22:07:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062550317] [2023-04-02 22:07:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:10,101 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-02 22:07:10,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062550317] [2023-04-02 22:07:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062550317] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:07:10,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:07:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143432520] [2023-04-02 22:07:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:07:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:07:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:07:10,103 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-02 22:07:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:10,141 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-04-02 22:07:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:07:10,142 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-02 22:07:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:10,145 INFO L225 Difference]: With dead ends: 57 [2023-04-02 22:07:10,145 INFO L226 Difference]: Without dead ends: 55 [2023-04-02 22:07:10,148 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-02 22:07:10,149 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 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-02 22:07:10,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-02 22:07:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2023-04-02 22:07:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 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-02 22:07:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-04-02 22:07:10,157 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 22 [2023-04-02 22:07:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:10,157 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-04-02 22:07:10,157 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-02 22:07:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-04-02 22:07:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 22:07:10,158 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:10,158 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, 1] [2023-04-02 22:07:10,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 22:07:10,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:10,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1847671524, now seen corresponding path program 1 times [2023-04-02 22:07:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217365629] [2023-04-02 22:07:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:10,231 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-02 22:07:10,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:10,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217365629] [2023-04-02 22:07:10,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217365629] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:10,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581482741] [2023-04-02 22:07:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:10,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:10,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:10,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:10,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 22:07:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:10,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-02 22:07:10,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:10,350 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-02 22:07:10,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:10,381 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-02 22:07:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581482741] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:10,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874233347] [2023-04-02 22:07:10,382 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-02 22:07:10,382 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:10,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:10,383 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:10,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:10,417 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:13,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:13,515 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:15,432 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1335#(and (<= 1 |#StackHeapBarrier|) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main____CPAchecker_TMP_2~0 (+ main_~main__index2~0 1)) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__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) (= ~__return_136~0 0) (<= 0 main_~i~0) (= |#NULL.offset| 0) (<= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) (= main_~main__loop_entered~0 1) (= main_~__VERIFIER_assert__cond~0 1) (= ~__return_main~0 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 1) (= |#NULL.base| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))' at error location [2023-04-02 22:07:15,432 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:07:15,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-04-02 22:07:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189922719] [2023-04-02 22:07:15,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 22:07:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 22:07:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 22:07:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2023-04-02 22:07:15,433 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-02 22:07:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:15,518 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-04-02 22:07:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 22:07:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 24 [2023-04-02 22:07:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:15,519 INFO L225 Difference]: With dead ends: 75 [2023-04-02 22:07:15,519 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 22:07:15,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2023-04-02 22:07:15,520 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:15,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:07:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 22:07:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-04-02 22:07:15,524 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-02 22:07:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-04-02 22:07:15,525 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2023-04-02 22:07:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:15,525 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-04-02 22:07:15,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-02 22:07:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-04-02 22:07:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 22:07:15,525 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:15,525 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-02 22:07:15,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 22:07:15,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:15,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:15,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1136108942, now seen corresponding path program 1 times [2023-04-02 22:07:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554682125] [2023-04-02 22:07:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:15,818 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-02 22:07:15,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554682125] [2023-04-02 22:07:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554682125] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46846346] [2023-04-02 22:07:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:15,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:15,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:15,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:15,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 22:07:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:15,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 22:07:15,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:15,902 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-02 22:07:15,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:07:15,926 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-02 22:07:15,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46846346] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:07:15,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [150781504] [2023-04-02 22:07:15,929 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-02 22:07:15,929 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:07:15,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:07:15,930 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:07:15,930 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:07:15,959 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2023-04-02 22:07:16,839 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2023-04-02 22:07:16,848 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:07:18,627 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1688#(and (<= 1 |#StackHeapBarrier|) (= (+ main_~main__index2~0 1) main_~main____CPAchecker_TMP_2~0) (= main_~__VERIFIER_assert__cond~2 0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__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) (= ~__return_136~0 0) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= main_~main__loop_entered~0 1) (= main_~__VERIFIER_assert__cond~0 1) (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) (= ~__return_main~0 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 1) (= |#NULL.base| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))' at error location [2023-04-02 22:07:18,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:07:18,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:07:18,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-04-02 22:07:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061195387] [2023-04-02 22:07:18,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 22:07:18,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 22:07:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 22:07:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-04-02 22:07:18,629 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-02 22:07:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:18,693 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-04-02 22:07:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:07:18,694 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-02 22:07:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:18,695 INFO L225 Difference]: With dead ends: 70 [2023-04-02 22:07:18,695 INFO L226 Difference]: Without dead ends: 41 [2023-04-02 22:07:18,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2023-04-02 22:07:18,696 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:18,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:07:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-02 22:07:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-02 22:07:18,701 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-02 22:07:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-04-02 22:07:18,701 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2023-04-02 22:07:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:18,701 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-04-02 22:07:18,701 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-02 22:07:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-04-02 22:07:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 22:07:18,702 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:07:18,702 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-02 22:07:18,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:18,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:18,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:07:18,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:07:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash -173879730, now seen corresponding path program 2 times [2023-04-02 22:07:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:07:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050365373] [2023-04-02 22:07:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:07:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:07:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:07:19,048 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-02 22:07:19,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:07:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050365373] [2023-04-02 22:07:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050365373] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:07:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879418529] [2023-04-02 22:07:19,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 22:07:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:07:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:07:19,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:07:19,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 22:07:19,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 22:07:19,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:07:19,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-02 22:07:19,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:07:20,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 22:07:20,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 22:07:20,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 22:07:20,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 22:07:20,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 22:07:20,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 910 treesize of output 523 [2023-04-02 22:07:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-02 22:07:20,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:07:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879418529] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:07:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:07:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2023-04-02 22:07:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500114127] [2023-04-02 22:07:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:07:20,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 22:07:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:07:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 22:07:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-04-02 22:07:20,735 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-02 22:07:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:07:21,791 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-04-02 22:07:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 22:07:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-02 22:07:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:07:21,792 INFO L225 Difference]: With dead ends: 59 [2023-04-02 22:07:21,792 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 22:07:21,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 22:07:21,793 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:07:21,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:07:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 22:07:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 22:07:21,794 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-02 22:07:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 22:07:21,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-04-02 22:07:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:07:21,794 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 22:07:21,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-02 22:07:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 22:07:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 22:07:21,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-04-02 22:07:21,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-04-02 22:07:21,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-04-02 22:07:21,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-04-02 22:07:21,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 22:07:22,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 22:07:22,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 22:07:23,382 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-02 22:07:23,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 14 200) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L895 garLoopResultBuilder]: At program point L118(lines 30 189) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (and (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (= main_~__VERIFIER_assert__cond~0 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-02 22:07:23,383 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse0 (mod main_~main__index2~0 4294967296))) (let ((.cse1 (< (mod (+ main_~i~0 4294967295) 4294967296) 100000)) (.cse2 (< (mod main_~main__index1~0 4294967296) .cse0)) (.cse3 (= main_~__VERIFIER_assert__cond~0 1)) (.cse4 (= |main_~#main__array~0.offset| 0)) (.cse6 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and (< .cse0 100000) (= main_~main____CPAchecker_TMP_0~0 1) .cse1 (= ~__tmp_155_0~0 1) .cse2 (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (<= 0 main_~i~0) .cse3 .cse4 (= main_~__tmp_1~0 1) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|)) (not (= |old(~__tmp_155_0~0)| 0)) (not (= ~__return_136~0 0)) (not (= ~__return_main~0 0)) (let ((.cse5 (mod (+ main_~main__index2~0 1) 4294967296))) (and .cse1 .cse2 (= main_~main____CPAchecker_TMP_0~1 1) (= main_~__VERIFIER_assert__cond~1 1) (< .cse5 100000) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) .cse5) .cse3 .cse4)) (not (= (select |old(#valid)| 3) 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 3) 12)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse6 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse6 1) 0)) (not (= (select |old(#length)| 2) 45))))) [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-04-02 22:07:23,383 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 104 131) the Hoare annotation is: (let ((.cse7 (+ main_~main__index2~0 1))) (let ((.cse3 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse2 (mod .cse7 4294967296))) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|)) (.cse4 (< .cse3 .cse2)) (.cse5 (= main_~__VERIFIER_assert__cond~0 1)) (.cse6 (= |main_~#main__array~0.offset| 0)) (.cse9 (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 (+ 2 main_~main__index2~0) 4294967296))) (and (<= 1 .cse0) (< .cse0 100000) (< (mod (+ main_~i~0 4294967295) 4294967296) 100000) (= (mod (select .cse1 (* .cse2 4)) 4294967296) (mod (select .cse1 (* .cse3 4)) 4294967296)) .cse4 .cse5 .cse6)) (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)) .cse5) (let ((.cse8 (mod main_~main____CPAchecker_TMP_2~0 4294967296))) (and (= .cse7 main_~main____CPAchecker_TMP_2~0) (= main_~main____CPAchecker_TMP_0~0 1) (= ~__tmp_155_0~0 1) (<= 100000 (mod main_~i~0 4294967296)) (< .cse8 100000) (<= 0 main_~i~0) (= (mod (select .cse1 (* 4 (mod main_~main____CPAchecker_TMP_1~0 4294967296))) 4294967296) (mod (select .cse1 (* .cse8 4)) 4294967296)) (= main_~main__loop_entered~0 1) .cse4 .cse5 (= main_~main__index1~0 (+ main_~main____CPAchecker_TMP_1~0 1)) .cse6 (= main_~__tmp_1~0 1) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))) (not (= (select .cse9 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse9 1) 0)) (not (= (select |old(#length)| 2) 45)))))) [2023-04-02 22:07:23,384 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)) (not (= |old(~__tmp_155_0~0)| 0)) (let ((.cse0 (mod (+ main_~main__index2~0 1) 4294967296))) (and (< (mod (+ main_~i~0 4294967295) 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= main_~main____CPAchecker_TMP_0~1 1) (< .cse0 100000) (< (mod (+ 4294967295 main_~main__index1~0) 4294967296) .cse0) (= main_~__VERIFIER_assert__cond~0 1) (= |main_~#main__array~0.offset| 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-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 188) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 194) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse14 (select |#memory_int| 1))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= 45 (select |#length| 2))) (.cse2 (= ~__tmp_155_0~0 0)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= (select |#valid| 3) 1)) (.cse5 (= (select |#valid| 1) 1)) (.cse6 (= main_~main__loop_entered~0 0)) (.cse7 (= (select |#valid| 0) 0)) (.cse8 (= (select |#valid| 2) 1)) (.cse9 (= (select .cse14 0) 48)) (.cse10 (= (select .cse14 1) 0)) (.cse11 (= |main_~#main__array~0.offset| 0)) (.cse12 (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|)) (.cse13 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 (< (mod (+ main_~i~0 4294967295) 4294967296) 100000) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 main_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (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 .cse13 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse13 1) 0)) (not (= (select |old(#length)| 2) 45))))) [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 124) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 14 200) no Hoare annotation was computed. [2023-04-02 22:07:23,384 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 200) 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-02 22:07:23,384 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) 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)) (let ((.cse1 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= main_~main____CPAchecker_TMP_0~0 1) (< (mod (+ main_~i~0 4294967295) 4294967296) 100000) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= (select |#valid| 1) 1) (<= 100000 (mod main_~i~0 4294967296)) (= main_~main__loop_entered~0 0) (<= 0 main_~i~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (<= main_~main__index2~0 (+ (* (div main_~main__index2~0 4294967296) 4294967296) 99999)) (= (select .cse1 1) 0) (= |main_~#main__array~0.offset| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#main__array~0.base|))))) [2023-04-02 22:07:23,384 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 183) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L902 garLoopResultBuilder]: At program point L129(lines 101 136) the Hoare annotation is: true [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 189) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-04-02 22:07:23,385 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-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2023-04-02 22:07:23,385 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-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 199) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 136) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-04-02 22:07:23,385 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-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:07:23,385 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:07:23,386 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-02 22:07:23,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 22:07:23,386 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 22:07:23,388 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:07:23,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 22:07:23,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 10:07:23 BoogieIcfgContainer [2023-04-02 22:07:23,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 22:07:23,413 INFO L158 Benchmark]: Toolchain (without parser) took 19569.82ms. Allocated memory was 200.3MB in the beginning and 562.0MB in the end (delta: 361.8MB). Free memory was 160.9MB in the beginning and 290.9MB in the end (delta: -130.0MB). Peak memory consumption was 233.3MB. Max. memory is 8.0GB. [2023-04-02 22:07:23,413 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 22:07:23,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.95ms. Allocated memory is still 200.3MB. Free memory was 160.9MB in the beginning and 148.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 22:07:23,414 INFO L158 Benchmark]: Boogie Preprocessor took 40.17ms. Allocated memory is still 200.3MB. Free memory was 148.4MB in the beginning and 146.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 22:07:23,414 INFO L158 Benchmark]: RCFGBuilder took 406.23ms. Allocated memory is still 200.3MB. Free memory was 146.7MB in the beginning and 129.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 22:07:23,414 INFO L158 Benchmark]: TraceAbstraction took 18881.08ms. Allocated memory was 200.3MB in the beginning and 562.0MB in the end (delta: 361.8MB). Free memory was 129.3MB in the beginning and 290.9MB in the end (delta: -161.5MB). Peak memory consumption was 201.8MB. Max. memory is 8.0GB. [2023-04-02 22:07:23,415 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.95ms. Allocated memory is still 200.3MB. Free memory was 160.9MB in the beginning and 148.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.17ms. Allocated memory is still 200.3MB. Free memory was 148.4MB in the beginning and 146.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.23ms. Allocated memory is still 200.3MB. Free memory was 146.7MB in the beginning and 129.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 18881.08ms. Allocated memory was 200.3MB in the beginning and 562.0MB in the end (delta: 361.8MB). Free memory was 129.3MB in the beginning and 290.9MB in the end (delta: -161.5MB). Peak memory consumption was 201.8MB. 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: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 171]: 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, 46 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 774 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 285 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 31 NumberOfFragments, 1387 HoareAnnotationTreeSize, 13 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 935 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 323 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 1247 SizeOfPredicates, 12 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 47/84 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: 1.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 20, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 19, TOOLS_POST_TIME: 1.3s, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 25, TOOLS_QUANTIFIERELIM_TIME: 1.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 52, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 2, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 20, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, 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: 200, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 1 - 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || ((4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296 && __VERIFIER_assert__cond == 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)) || !(\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)) || ((((((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && main____CPAchecker_TMP_0 == 1) && (i + 4294967295) % 4294967296 < 100000) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && \valid[1] == 1) && 100000 <= i % 4294967296) && main__loop_entered == 0) && 0 <= i) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && main__index2 <= main__index2 / 4294967296 * 4294967296 + 99999) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array) - 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) || ((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && (i + 4294967295) % 4294967296 < 100000) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && \valid[1] == 1) && main__loop_entered == 0) && 0 <= i) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || (((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && \valid[1] == 1) && main__loop_entered == 0) && i == 0) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && main__array == 0) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\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: 66]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_155_0) == 0)) || (((((((i + 4294967295) % 4294967296 < 100000 && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && (main__index2 + 1) % 4294967296 < 100000) && (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)) || !(\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 && main____CPAchecker_TMP_0 == 1) && (i + 4294967295) % 4294967296 < 100000) && __tmp_155_0 == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && 100000 <= i % 4294967296) && main__loop_entered == 0) && 0 <= i) && __VERIFIER_assert__cond == 1) && main__array == 0) && __tmp_1 == 1) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\old(__tmp_155_0) == 0)) || !(__return_136 == 0)) || !(__return_main == 0)) || ((((((((i + 4294967295) % 4294967296 < 100000 && main__index1 % 4294967296 < main__index2 % 4294967296) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) && (main__index2 + 1) % 4294967296 < 100000) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 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: 104]: 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)) || ((((((1 <= (2 + main__index2) % 4294967296 && (2 + main__index2) % 4294967296 < 100000) && (i + 4294967295) % 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)) || !(\old(unknown-#length-unknown)[3] == 12)) || !(\old(unknown-#length-unknown)[1] == 2)) || (main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1)) || (((((((((((((main__index2 + 1 == main____CPAchecker_TMP_2 && main____CPAchecker_TMP_0 == 1) && __tmp_155_0 == 1) && 100000 <= i % 4294967296) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && 0 <= i) && 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) && unknown-#StackHeapBarrier-unknown + 1 <= main__array)) || !(\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-02 22:07:23,458 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...