./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60035180ad93ee19bf4d992ab5c22fc9a9b898dcfe886a7e5b520105473a6903 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 11:02:55,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:02:55,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:02:55,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:02:55,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:02:55,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:02:55,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:02:55,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:02:55,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:02:55,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:02:55,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:02:55,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:02:55,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:02:55,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:02:55,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:02:55,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:02:55,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:02:55,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:02:55,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:02:55,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:02:55,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:02:55,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:02:55,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:02:55,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:02:55,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:02:55,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:02:55,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:02:55,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:02:55,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:02:55,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:02:55,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:02:55,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:02:55,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:02:55,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:02:55,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:02:55,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:02:55,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:02:55,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:02:55,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:02:55,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:02:55,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:02:55,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:02:55,183 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:02:55,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:02:55,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:02:55,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:02:55,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:02:55,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:02:55,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:02:55,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:02:55,185 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:02:55,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:02:55,186 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:02:55,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:02:55,187 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:02:55,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:02:55,188 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:02:55,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:02:55,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:02:55,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:02:55,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:02:55,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:02:55,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:02:55,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:02:55,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:02:55,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:02:55,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:02:55,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:02:55,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:02:55,190 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:02:55,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:02:55,190 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:02:55,191 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60035180ad93ee19bf4d992ab5c22fc9a9b898dcfe886a7e5b520105473a6903 [2023-02-15 11:02:55,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:02:55,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:02:55,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:02:55,460 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:02:55,460 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:02:55,461 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-02-15 11:02:56,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:02:56,676 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:02:56,676 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-02-15 11:02:56,681 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596108980/ce0f6b737cdb49fcb326c2549af86621/FLAGc5406e94a [2023-02-15 11:02:56,692 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596108980/ce0f6b737cdb49fcb326c2549af86621 [2023-02-15 11:02:56,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:02:56,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:02:56,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:02:56,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:02:56,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:02:56,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff8b44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56, skipping insertion in model container [2023-02-15 11:02:56,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:02:56,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:02:56,851 WARN L237 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-02-15 11:02:56,857 WARN L237 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-02-15 11:02:56,860 WARN L237 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-02-15 11:02:56,864 WARN L237 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-02-15 11:02:56,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:02:56,872 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:02:56,884 WARN L237 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-02-15 11:02:56,887 WARN L237 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-02-15 11:02:56,889 WARN L237 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-02-15 11:02:56,892 WARN L237 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-02-15 11:02:56,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:02:56,905 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:02:56,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56 WrapperNode [2023-02-15 11:02:56,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:02:56,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:02:56,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:02:56,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:02:56,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,946 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 158 [2023-02-15 11:02:56,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:02:56,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:02:56,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:02:56,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:02:56,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:02:56,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:02:56,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:02:56,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:02:56,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (1/1) ... [2023-02-15 11:02:56,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:02:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:02:56,998 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-02-15 11:02:57,006 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-02-15 11:02:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:02:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:02:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 11:02:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 11:02:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:02:57,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:02:57,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 11:02:57,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 11:02:57,134 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:02:57,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:02:57,388 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:02:57,393 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:02:57,394 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 11:02:57,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:02:57 BoogieIcfgContainer [2023-02-15 11:02:57,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:02:57,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:02:57,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:02:57,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:02:57,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:02:56" (1/3) ... [2023-02-15 11:02:57,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b2df22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:02:57, skipping insertion in model container [2023-02-15 11:02:57,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:02:56" (2/3) ... [2023-02-15 11:02:57,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b2df22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:02:57, skipping insertion in model container [2023-02-15 11:02:57,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:02:57" (3/3) ... [2023-02-15 11:02:57,402 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2023-02-15 11:02:57,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:02:57,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-02-15 11:02:57,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:02:57,486 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=PETRI_NET, 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;@3bf15028, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:02:57,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-02-15 11:02:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 39 states have internal predecessors, (58), 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-02-15 11:02:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 11:02:57,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:57,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:57,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 687414397, now seen corresponding path program 1 times [2023-02-15 11:02:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:57,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964897008] [2023-02-15 11:02:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:57,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964897008] [2023-02-15 11:02:57,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964897008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:02:57,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:02:57,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:02:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898820377] [2023-02-15 11:02:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:02:57,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:02:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:02:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:02:57,808 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 39 states have internal predecessors, (58), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-15 11:02:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:57,858 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2023-02-15 11:02:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:02:57,861 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), 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) Word has length 11 [2023-02-15 11:02:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:57,867 INFO L225 Difference]: With dead ends: 78 [2023-02-15 11:02:57,867 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 11:02:57,870 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-02-15 11:02:57,876 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:57,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 11:02:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-02-15 11:02:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 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-02-15 11:02:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-15 11:02:57,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2023-02-15 11:02:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:57,902 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-15 11:02:57,902 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), 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-02-15 11:02:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-15 11:02:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 11:02:57,903 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:57,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 11:02:57,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1851126331, now seen corresponding path program 1 times [2023-02-15 11:02:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172727763] [2023-02-15 11:02:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:58,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172727763] [2023-02-15 11:02:58,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172727763] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:02:58,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847584453] [2023-02-15 11:02:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:02:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:02:58,061 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-02-15 11:02:58,066 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-02-15 11:02:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 11:02:58,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:02:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:02:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847584453] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 11:02:58,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:02:58,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-02-15 11:02:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089343590] [2023-02-15 11:02:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:02:58,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:02:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:58,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:02:58,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:02:58,201 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-15 11:02:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:58,227 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-02-15 11:02:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:02:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2023-02-15 11:02:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:58,230 INFO L225 Difference]: With dead ends: 44 [2023-02-15 11:02:58,235 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:02:58,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:02:58,237 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:58,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:02:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 11:02:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 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-02-15 11:02:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-15 11:02:58,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 13 [2023-02-15 11:02:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:58,250 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-15 11:02:58,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-15 11:02:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-15 11:02:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 11:02:58,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:58,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:58,259 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-02-15 11:02:58,456 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-02-15 11:02:58,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -687726149, now seen corresponding path program 1 times [2023-02-15 11:02:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:58,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102713381] [2023-02-15 11:02:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:02:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102713381] [2023-02-15 11:02:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102713381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:02:58,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:02:58,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:02:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435538649] [2023-02-15 11:02:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:02:58,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:02:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:02:58,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:02:58,511 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-15 11:02:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:58,535 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-02-15 11:02:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:02:58,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2023-02-15 11:02:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:58,536 INFO L225 Difference]: With dead ends: 60 [2023-02-15 11:02:58,536 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 11:02:58,537 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-02-15 11:02:58,538 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:58,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 11:02:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-02-15 11:02:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-02-15 11:02:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 11:02:58,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 14 [2023-02-15 11:02:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:58,544 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 11:02:58,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-15 11:02:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 11:02:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 11:02:58,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:58,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 11:02:58,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash -757168970, now seen corresponding path program 1 times [2023-02-15 11:02:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:58,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549049326] [2023-02-15 11:02:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:02:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:58,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549049326] [2023-02-15 11:02:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549049326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:02:58,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:02:58,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 11:02:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104652498] [2023-02-15 11:02:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:02:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:02:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:02:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:02:58,607 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02-15 11:02:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:58,629 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2023-02-15 11:02:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 11:02:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2023-02-15 11:02:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:58,630 INFO L225 Difference]: With dead ends: 53 [2023-02-15 11:02:58,631 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 11:02:58,631 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-02-15 11:02:58,632 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:58,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 11:02:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2023-02-15 11:02:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 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-02-15 11:02:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-02-15 11:02:58,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2023-02-15 11:02:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:58,638 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-02-15 11:02:58,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02-15 11:02:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-02-15 11:02:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 11:02:58,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:58,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:58,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 11:02:58,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1934485875, now seen corresponding path program 1 times [2023-02-15 11:02:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:58,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302055176] [2023-02-15 11:02:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:02:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302055176] [2023-02-15 11:02:58,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302055176] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:02:58,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:02:58,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:02:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821580637] [2023-02-15 11:02:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:02:58,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:02:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:02:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:02:58,695 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-15 11:02:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:58,728 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-02-15 11:02:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:02:58,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2023-02-15 11:02:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:58,729 INFO L225 Difference]: With dead ends: 56 [2023-02-15 11:02:58,729 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 11:02:58,729 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-02-15 11:02:58,730 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:58,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 11:02:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-02-15 11:02:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 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-02-15 11:02:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-02-15 11:02:58,734 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2023-02-15 11:02:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:58,734 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-02-15 11:02:58,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-15 11:02:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-02-15 11:02:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 11:02:58,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:58,735 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] [2023-02-15 11:02:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 11:02:58,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -9245930, now seen corresponding path program 1 times [2023-02-15 11:02:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:58,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528920095] [2023-02-15 11:02:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528920095] [2023-02-15 11:02:58,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528920095] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:02:58,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137951792] [2023-02-15 11:02:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:58,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:02:58,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:02:58,860 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-02-15 11:02:58,867 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-02-15 11:02:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:58,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:02:58,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:02:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:02:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137951792] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:02:58,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:02:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 11:02:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894179716] [2023-02-15 11:02:58,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:02:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 11:02:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:02:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 11:02:58,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-15 11:02:58,981 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-02-15 11:02:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:02:59,022 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-02-15 11:02:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 11:02:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) Word has length 20 [2023-02-15 11:02:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:02:59,025 INFO L225 Difference]: With dead ends: 59 [2023-02-15 11:02:59,025 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 11:02:59,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:02:59,028 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:02:59,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:02:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 11:02:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-15 11:02:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 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-02-15 11:02:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 11:02:59,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2023-02-15 11:02:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:02:59,042 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 11:02:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-02-15 11:02:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 11:02:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 11:02:59,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:02:59,043 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:02:59,055 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-02-15 11:02:59,249 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-02-15 11:02:59,249 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:02:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:02:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1951228316, now seen corresponding path program 2 times [2023-02-15 11:02:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:02:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992784158] [2023-02-15 11:02:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:02:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:02:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:02:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:02:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:02:59,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992784158] [2023-02-15 11:02:59,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992784158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:02:59,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439193219] [2023-02-15 11:02:59,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:02:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:02:59,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:02:59,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:02:59,467 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-02-15 11:02:59,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 11:02:59,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:02:59,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 11:02:59,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:03:00,151 INFO L321 Elim1Store]: treesize reduction 120, result has 5.5 percent of original size [2023-02-15 11:03:00,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 356 treesize of output 156 [2023-02-15 11:03:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 11:03:00,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:03:00,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439193219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:00,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 11:03:00,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2023-02-15 11:03:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711149416] [2023-02-15 11:03:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:00,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 11:03:00,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 11:03:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-02-15 11:03:00,285 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-02-15 11:03:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:00,619 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-02-15 11:03:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 11:03:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) Word has length 26 [2023-02-15 11:03:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:00,621 INFO L225 Difference]: With dead ends: 51 [2023-02-15 11:03:00,621 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 11:03:00,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-02-15 11:03:00,622 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:00,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:03:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 11:03:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-02-15 11:03:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-02-15 11:03:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-15 11:03:00,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2023-02-15 11:03:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:00,626 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-15 11:03:00,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-02-15 11:03:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-15 11:03:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 11:03:00,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:00,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:00,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 11:03:00,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:03:00,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-15 11:03:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash -321915466, now seen corresponding path program 1 times [2023-02-15 11:03:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:00,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610651127] [2023-02-15 11:03:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 11:03:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:00,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610651127] [2023-02-15 11:03:00,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610651127] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:00,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:00,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 11:03:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330607528] [2023-02-15 11:03:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 11:03:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 11:03:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 11:03:00,945 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-15 11:03:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:00,981 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-15 11:03:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 11:03:00,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 27 [2023-02-15 11:03:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:00,982 INFO L225 Difference]: With dead ends: 34 [2023-02-15 11:03:00,982 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 11:03:00,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-02-15 11:03:00,984 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:00,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 11:03:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 11:03:00,985 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-02-15 11:03:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 11:03:00,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2023-02-15 11:03:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:00,986 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 11:03:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-02-15 11:03:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 11:03:00,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 11:03:00,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-02-15 11:03:00,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-02-15 11:03:00,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-02-15 11:03:00,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-02-15 11:03:00,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 11:03:00,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 11:03:01,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-02-15 11:03:01,235 INFO L895 garLoopResultBuilder]: At program point L118(lines 30 189) the Hoare annotation is: (let ((.cse0 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse1 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< .cse0 .cse1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ (* 4 .cse0) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse1 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296))))) [2023-02-15 11:03:01,235 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1))) (let ((.cse0 (let ((.cse7 (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (let ((.cse3 (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) .cse7))) (or (let ((.cse4 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse5 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and .cse3 (< .cse4 .cse5) (< .cse5 100000) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse6 (+ (* 4 .cse4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse6 (+ (* .cse5 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296))))) (and .cse3 (< .cse7 100000) .cse1))))) (.cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1))) (or (and .cse0 .cse1 .cse2) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) .cse0 (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 0)) .cse2)))) [2023-02-15 11:03:01,235 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 11:03:01,235 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-02-15 11:03:01,235 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 14 200) the Hoare annotation is: true [2023-02-15 11:03:01,235 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 104 131) the Hoare annotation is: (or (let ((.cse0 (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (and (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) .cse0) (< .cse0 100000) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1))) (let ((.cse1 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse2 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< .cse1 .cse2) (< .cse2 100000) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse3 (+ (* 4 .cse1) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse3 (+ (* .cse2 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296)))))) [2023-02-15 11:03:01,235 INFO L895 garLoopResultBuilder]: At program point L69(lines 66 92) the Hoare annotation is: (let ((.cse0 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse1 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296)) (< .cse0 .cse1) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ (* 4 .cse0) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse1 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296))) (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 0)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1))) [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 188) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 194) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (= (mod |ULTIMATE.start_main_~main__loop_entered~0#1| 4294967296) 0) [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 124) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 11:03:01,236 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) the Hoare annotation is: (and (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296)) (<= |ULTIMATE.start_main_~main__index2~0#1| (+ 99999 (* (div |ULTIMATE.start_main_~main__index2~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1) (= (mod |ULTIMATE.start_main_~main__loop_entered~0#1| 4294967296) 0)) [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 183) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L902 garLoopResultBuilder]: At program point L129(lines 101 136) the Hoare annotation is: true [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 189) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L895 garLoopResultBuilder]: At program point L89(lines 64 97) the Hoare annotation is: false [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L895 garLoopResultBuilder]: At program point L148(lines 33 156) the Hoare annotation is: false [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 199) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-02-15 11:03:01,237 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2023-02-15 11:03:01,239 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 136) no Hoare annotation was computed. [2023-02-15 11:03:01,239 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-02-15 11:03:01,242 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:01,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:03:01,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:03:01 BoogieIcfgContainer [2023-02-15 11:03:01,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:03:01,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:03:01,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:03:01,261 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:03:01,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:02:57" (3/4) ... [2023-02-15 11:03:01,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 11:03:01,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-02-15 11:03:01,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 11:03:01,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 11:03:01,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 11:03:01,316 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:03:01,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:03:01,317 INFO L158 Benchmark]: Toolchain (without parser) took 4621.39ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 80.6MB in the beginning and 75.8MB in the end (delta: 4.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,317 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:03:01,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.37ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 68.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.74ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,318 INFO L158 Benchmark]: Boogie Preprocessor took 23.01ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,318 INFO L158 Benchmark]: RCFGBuilder took 424.07ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 50.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,319 INFO L158 Benchmark]: TraceAbstraction took 3862.94ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.5MB in the beginning and 78.9MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:03:01,319 INFO L158 Benchmark]: Witness Printer took 56.08ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 75.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 11:03:01,320 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.18ms. Allocated memory is still 117.4MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.37ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 68.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.74ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.01ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.07ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 50.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3862.94ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.5MB in the beginning and 78.9MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.08ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 75.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 1 procedures, 40 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 248 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 44, 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, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 24 NumberOfFragments, 386 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 199 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 712 SizeOfPredicates, 13 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 36/57 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__loop_entered % 4294967296 == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 <= 99999 + main__index2 / 4294967296 * 4294967296) && main____CPAchecker_TMP_0 == 1) && main__loop_entered % 4294967296 == 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) || ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && main____CPAchecker_TMP_0 == 1)) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) || (((!(__VERIFIER_assert__cond == 0) && ((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) || ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && main____CPAchecker_TMP_0 == 1))) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296 && __VERIFIER_assert__cond == 1) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && __VERIFIER_assert__cond == 1) || (((4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296 && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) RESULT: Ultimate proved your program to be correct! [2023-02-15 11:03:01,344 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE