./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array6_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-patterns/array6_pattern.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 81db346fb66b40514998cf838e858b3f0793fe5c74d5812efa60193ab54d6833 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:52,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:52,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:52,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:52,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:52,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:52,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:52,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:52,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:52,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:52,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:52,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:52,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:52,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:52,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:52,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:52,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:52,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:52,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:52,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:52,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:52,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:52,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:52,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:52,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:52,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:52,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:52,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:52,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:52,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:52,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:52,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:52,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:52,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:52,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:52,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:52,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:52,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:52,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:52,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:52,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:52,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:24:52,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:52,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:52,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:52,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:52,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:52,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:52,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:52,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:52,119 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:52,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:52,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:52,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:52,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:52,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:52,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:52,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:52,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:52,121 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:52,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:52,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:52,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:52,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:52,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:52,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:52,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:52,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:52,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:52,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:52,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:52,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:52,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:52,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:52,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:52,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.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 -> 81db346fb66b40514998cf838e858b3f0793fe5c74d5812efa60193ab54d6833 [2022-02-20 14:24:52,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:52,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:52,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:52,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:52,344 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:52,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array6_pattern.c [2022-02-20 14:24:52,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54f358bc/113c2ea55b9a45bc91f5137414d5508e/FLAG21ce7986b [2022-02-20 14:24:52,750 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:52,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c [2022-02-20 14:24:52,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54f358bc/113c2ea55b9a45bc91f5137414d5508e/FLAG21ce7986b [2022-02-20 14:24:52,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54f358bc/113c2ea55b9a45bc91f5137414d5508e [2022-02-20 14:24:52,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:52,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:52,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:52,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:52,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:52,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:52" (1/1) ... [2022-02-20 14:24:52,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fc66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:52, skipping insertion in model container [2022-02-20 14:24:52,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:52" (1/1) ... [2022-02-20 14:24:52,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:52,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:52,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c[1356,1369] [2022-02-20 14:24:52,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:52,964 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:52,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c[1356,1369] [2022-02-20 14:24:52,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:53,006 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:53,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53 WrapperNode [2022-02-20 14:24:53,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:53,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:53,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:53,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:53,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,063 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2022-02-20 14:24:53,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:53,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:53,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:53,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:53,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:53,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:53,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:53,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:53,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:53,157 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) [2022-02-20 14:24:53,162 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 [2022-02-20 14:24:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:24:53,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:24:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:53,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:53,239 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:53,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:53,536 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:53,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:53,542 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:24:53,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:53 BoogieIcfgContainer [2022-02-20 14:24:53,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:53,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:53,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:53,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:53,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:52" (1/3) ... [2022-02-20 14:24:53,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b629a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:53, skipping insertion in model container [2022-02-20 14:24:53,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (2/3) ... [2022-02-20 14:24:53,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b629a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:53, skipping insertion in model container [2022-02-20 14:24:53,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:53" (3/3) ... [2022-02-20 14:24:53,550 INFO L111 eAbstractionObserver]: Analyzing ICFG array6_pattern.c [2022-02-20 14:24:53,556 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:53,556 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:53,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:53,611 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:24:53,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:24:53,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:53,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:53,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2022-02-20 14:24:53,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:53,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326103094] [2022-02-20 14:24:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:53,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 14:24:53,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 14:24:53,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 14:24:53,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {28#true} #73#return; {29#false} is VALID [2022-02-20 14:24:53,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {28#true} is VALID [2022-02-20 14:24:53,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {28#true} is VALID [2022-02-20 14:24:53,792 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {28#true} is VALID [2022-02-20 14:24:53,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 14:24:53,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 14:24:53,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 14:24:53,793 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #73#return; {29#false} is VALID [2022-02-20 14:24:53,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {29#false} is VALID [2022-02-20 14:24:53,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 14:24:53,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 14:24:53,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} main_~count~0#1 := 0; {29#false} is VALID [2022-02-20 14:24:53,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 14:24:53,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {29#false} is VALID [2022-02-20 14:24:53,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0 == __VERIFIER_assert_~cond#1; {29#false} is VALID [2022-02-20 14:24:53,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 14:24:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:53,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:53,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326103094] [2022-02-20 14:24:53,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326103094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:53,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:53,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:53,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832570291] [2022-02-20 14:24:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:24:53,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:53,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:53,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:53,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:53,858 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:53,920 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-02-20 14:24:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:53,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:24:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 14:24:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 14:24:53,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2022-02-20 14:24:54,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,031 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:24:54,031 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 14:24:54,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:54,038 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:54,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 14:24:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 14:24:54,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:54,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,068 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,069 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,076 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 14:24:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:24:54,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 14:24:54,078 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 14:24:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,081 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 14:24:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:24:54,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:54,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 14:24:54,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-02-20 14:24:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:54,092 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 14:24:54,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:24:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:24:54,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:54,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:54,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:54,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2022-02-20 14:24:54,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:54,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068658722] [2022-02-20 14:24:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} ~cond := #in~cond; {162#true} is VALID [2022-02-20 14:24:54,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume !(0 == ~cond); {162#true} is VALID [2022-02-20 14:24:54,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-02-20 14:24:54,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #73#return; {162#true} is VALID [2022-02-20 14:24:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 14:24:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} ~cond := #in~cond; {162#true} is VALID [2022-02-20 14:24:54,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume !(0 == ~cond); {162#true} is VALID [2022-02-20 14:24:54,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-02-20 14:24:54,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} #75#return; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {162#true} is VALID [2022-02-20 14:24:54,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {162#true} is VALID [2022-02-20 14:24:54,322 INFO L272 TraceCheckUtils]: 2: Hoare triple {162#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {162#true} is VALID [2022-02-20 14:24:54,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#true} ~cond := #in~cond; {162#true} is VALID [2022-02-20 14:24:54,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#true} assume !(0 == ~cond); {162#true} is VALID [2022-02-20 14:24:54,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} assume true; {162#true} is VALID [2022-02-20 14:24:54,325 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {162#true} {162#true} #73#return; {162#true} is VALID [2022-02-20 14:24:54,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,332 INFO L272 TraceCheckUtils]: 10: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {162#true} is VALID [2022-02-20 14:24:54,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#true} ~cond := #in~cond; {162#true} is VALID [2022-02-20 14:24:54,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#true} assume !(0 == ~cond); {162#true} is VALID [2022-02-20 14:24:54,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#true} assume true; {162#true} is VALID [2022-02-20 14:24:54,334 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {162#true} {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} #75#return; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~count~0#1 := 0; {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {173#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:24:54,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {173#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {163#false} is VALID [2022-02-20 14:24:54,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-02-20 14:24:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:54,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:54,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068658722] [2022-02-20 14:24:54,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068658722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:54,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:54,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:54,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333455258] [2022-02-20 14:24:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 14:24:54,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:54,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:54,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:54,373 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,438 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:24:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 14:24:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 14:24:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 14:24:54,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 14:24:54,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,469 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:24:54,469 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:24:54,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:54,471 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:54,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:24:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 14:24:54,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:54,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,475 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,475 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,477 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:24:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:24:54,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 14:24:54,478 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 14:24:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,486 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:24:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:24:54,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:54,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 14:24:54,489 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2022-02-20 14:24:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:54,489 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 14:24:54,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:24:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:24:54,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:54,491 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:54,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:24:54,491 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2022-02-20 14:24:54,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:54,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892755112] [2022-02-20 14:24:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} ~cond := #in~cond; {282#true} is VALID [2022-02-20 14:24:54,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume !(0 == ~cond); {282#true} is VALID [2022-02-20 14:24:54,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 14:24:54,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #73#return; {282#true} is VALID [2022-02-20 14:24:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 14:24:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} ~cond := #in~cond; {282#true} is VALID [2022-02-20 14:24:54,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume !(0 == ~cond); {282#true} is VALID [2022-02-20 14:24:54,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 14:24:54,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#true} {289#(<= ~ARR_SIZE~0 0)} #75#return; {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {282#true} is VALID [2022-02-20 14:24:54,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {282#true} is VALID [2022-02-20 14:24:54,597 INFO L272 TraceCheckUtils]: 2: Hoare triple {282#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {282#true} is VALID [2022-02-20 14:24:54,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#true} ~cond := #in~cond; {282#true} is VALID [2022-02-20 14:24:54,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {282#true} assume !(0 == ~cond); {282#true} is VALID [2022-02-20 14:24:54,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 14:24:54,598 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {282#true} {282#true} #73#return; {282#true} is VALID [2022-02-20 14:24:54,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {288#(= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:54,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= |ULTIMATE.start_main_~count~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#(<= ~ARR_SIZE~0 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,600 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {282#true} is VALID [2022-02-20 14:24:54,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#true} ~cond := #in~cond; {282#true} is VALID [2022-02-20 14:24:54,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#true} assume !(0 == ~cond); {282#true} is VALID [2022-02-20 14:24:54,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 14:24:54,602 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {282#true} {289#(<= ~ARR_SIZE~0 0)} #75#return; {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#(<= ~ARR_SIZE~0 0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {289#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:54,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {289#(<= ~ARR_SIZE~0 0)} main_~count~0#1 := 0; {294#(and (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~ARR_SIZE~0 0))} is VALID [2022-02-20 14:24:54,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#(and (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~ARR_SIZE~0 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {283#false} is VALID [2022-02-20 14:24:54,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {283#false} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {283#false} is VALID [2022-02-20 14:24:54,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {283#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {283#false} is VALID [2022-02-20 14:24:54,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {283#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {283#false} is VALID [2022-02-20 14:24:54,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {283#false} assume 0 == __VERIFIER_assert_~cond#1; {283#false} is VALID [2022-02-20 14:24:54,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {283#false} assume !false; {283#false} is VALID [2022-02-20 14:24:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:54,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:54,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892755112] [2022-02-20 14:24:54,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892755112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:54,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:54,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:54,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313904544] [2022-02-20 14:24:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 14:24:54,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:54,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:54,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:54,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:54,632 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,727 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 14:24:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:24:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 14:24:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:24:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:24:54,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 14:24:54,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,770 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:24:54,771 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:24:54,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:54,772 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:54,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:24:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-20 14:24:54,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:54,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,777 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,777 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,778 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 14:24:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 14:24:54,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 14:24:54,780 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 14:24:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,781 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 14:24:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 14:24:54,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:54,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-20 14:24:54,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 24 [2022-02-20 14:24:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:54,784 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-20 14:24:54,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 14:24:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:24:54,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:54,785 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:54,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:24:54,786 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2022-02-20 14:24:54,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:54,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352156773] [2022-02-20 14:24:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:54,807 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:54,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965027229] [2022-02-20 14:24:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:54,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:54,810 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) [2022-02-20 14:24:54,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:24:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:24:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:55,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {429#true} is VALID [2022-02-20 14:24:55,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {429#true} is VALID [2022-02-20 14:24:55,149 INFO L272 TraceCheckUtils]: 2: Hoare triple {429#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {429#true} is VALID [2022-02-20 14:24:55,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#true} ~cond := #in~cond; {429#true} is VALID [2022-02-20 14:24:55,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {429#true} assume !(0 == ~cond); {429#true} is VALID [2022-02-20 14:24:55,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {429#true} assume true; {429#true} is VALID [2022-02-20 14:24:55,150 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {429#true} {429#true} #73#return; {429#true} is VALID [2022-02-20 14:24:55,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {455#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:55,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {455#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:55,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:55,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {466#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:55,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {466#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:55,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {466#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:55,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {476#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:24:55,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {480#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:55,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {480#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:55,157 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {480#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {466#(<= ~ARR_SIZE~0 1)} #75#return; {430#false} is VALID [2022-02-20 14:24:55,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {430#false} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {430#false} is VALID [2022-02-20 14:24:55,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {430#false} assume 0 == main_~temp~0#1; {430#false} is VALID [2022-02-20 14:24:55,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {430#false} main_~count~0#1 := 0; {430#false} is VALID [2022-02-20 14:24:55,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {430#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {430#false} is VALID [2022-02-20 14:24:55,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {430#false} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {430#false} is VALID [2022-02-20 14:24:55,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {430#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {430#false} is VALID [2022-02-20 14:24:55,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {430#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {430#false} is VALID [2022-02-20 14:24:55,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {430#false} assume 0 == __VERIFIER_assert_~cond#1; {430#false} is VALID [2022-02-20 14:24:55,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 14:24:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:24:55,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:55,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 14:24:55,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {430#false} assume 0 == __VERIFIER_assert_~cond#1; {430#false} is VALID [2022-02-20 14:24:55,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {430#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {430#false} is VALID [2022-02-20 14:24:55,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {430#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {430#false} is VALID [2022-02-20 14:24:55,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {430#false} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {430#false} is VALID [2022-02-20 14:24:55,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {430#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {430#false} is VALID [2022-02-20 14:24:55,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {430#false} main_~count~0#1 := 0; {430#false} is VALID [2022-02-20 14:24:55,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {430#false} assume 0 == main_~temp~0#1; {430#false} is VALID [2022-02-20 14:24:55,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {430#false} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {430#false} is VALID [2022-02-20 14:24:55,478 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {545#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)))} {541#(<= ~ARR_SIZE~0 2)} #75#return; {430#false} is VALID [2022-02-20 14:24:55,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)))} assume true; {545#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)))} is VALID [2022-02-20 14:24:55,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {545#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)))} is VALID [2022-02-20 14:24:55,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#true} ~cond := #in~cond; {552#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 2)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:24:55,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {541#(<= ~ARR_SIZE~0 2)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {429#true} is VALID [2022-02-20 14:24:55,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(<= ~ARR_SIZE~0 2)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {541#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:24:55,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {562#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {541#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:24:55,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {562#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:24:55,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:55,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {462#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:55,501 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {429#true} {429#true} #73#return; {429#true} is VALID [2022-02-20 14:24:55,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {429#true} assume true; {429#true} is VALID [2022-02-20 14:24:55,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {429#true} assume !(0 == ~cond); {429#true} is VALID [2022-02-20 14:24:55,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#true} ~cond := #in~cond; {429#true} is VALID [2022-02-20 14:24:55,502 INFO L272 TraceCheckUtils]: 2: Hoare triple {429#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {429#true} is VALID [2022-02-20 14:24:55,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {429#true} is VALID [2022-02-20 14:24:55,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {429#true} is VALID [2022-02-20 14:24:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:55,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:55,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352156773] [2022-02-20 14:24:55,503 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:55,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965027229] [2022-02-20 14:24:55,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965027229] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:55,504 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:55,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:24:55,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261583446] [2022-02-20 14:24:55,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-02-20 14:24:55,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:55,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:55,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:55,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:24:55,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:24:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:24:55,547 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:56,000 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-02-20 14:24:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 14:24:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-02-20 14:24:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:24:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:24:56,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-02-20 14:24:56,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:56,090 INFO L225 Difference]: With dead ends: 71 [2022-02-20 14:24:56,090 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 14:24:56,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:24:56,092 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:56,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 96 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 14:24:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-02-20 14:24:56,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:56,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:56,112 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:56,113 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:56,115 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 14:24:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 14:24:56,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:56,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:56,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 14:24:56,116 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 14:24:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:56,118 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 14:24:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 14:24:56,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:56,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:56,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:56,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 14:24:56,120 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 26 [2022-02-20 14:24:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:56,120 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 14:24:56,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 14:24:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:24:56,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:56,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:56,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:56,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:56,340 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1559224519, now seen corresponding path program 2 times [2022-02-20 14:24:56,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:56,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17529016] [2022-02-20 14:24:56,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:56,380 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:56,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424909863] [2022-02-20 14:24:56,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:24:56,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:56,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:56,384 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) [2022-02-20 14:24:56,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:24:56,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:24:56,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:24:56,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:24:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:56,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:56,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {825#true} is VALID [2022-02-20 14:24:56,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {825#true} is VALID [2022-02-20 14:24:56,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {825#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {825#true} is VALID [2022-02-20 14:24:56,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 14:24:56,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {825#true} assume !(0 == ~cond); {825#true} is VALID [2022-02-20 14:24:56,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 14:24:56,674 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {825#true} {825#true} #73#return; {825#true} is VALID [2022-02-20 14:24:56,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {825#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {865#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(< 2 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {869#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#(< 2 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,680 INFO L272 TraceCheckUtils]: 16: Hoare triple {869#(< 2 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#(< 2 ~ARR_SIZE~0)} ~cond := #in~cond; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {869#(< 2 ~ARR_SIZE~0)} assume !(0 == ~cond); {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {869#(< 2 ~ARR_SIZE~0)} assume true; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,682 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {869#(< 2 ~ARR_SIZE~0)} {869#(< 2 ~ARR_SIZE~0)} #75#return; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {869#(< 2 ~ARR_SIZE~0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {869#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {869#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {869#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {903#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:24:56,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {903#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {903#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:24:56,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {903#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {910#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {910#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {826#false} is VALID [2022-02-20 14:24:56,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {826#false} is VALID [2022-02-20 14:24:56,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#false} assume 0 == __VERIFIER_assert_~cond#1; {826#false} is VALID [2022-02-20 14:24:56,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-02-20 14:24:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:56,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:56,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-02-20 14:24:56,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#false} assume 0 == __VERIFIER_assert_~cond#1; {826#false} is VALID [2022-02-20 14:24:56,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {826#false} is VALID [2022-02-20 14:24:56,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {932#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {826#false} is VALID [2022-02-20 14:24:56,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {936#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {932#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {936#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {936#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {943#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {936#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {943#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {943#(< 1 ~ARR_SIZE~0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,864 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {825#true} {943#(< 1 ~ARR_SIZE~0)} #75#return; {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 14:24:56,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {825#true} assume !(0 == ~cond); {825#true} is VALID [2022-02-20 14:24:56,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 14:24:56,864 INFO L272 TraceCheckUtils]: 16: Hoare triple {943#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {825#true} is VALID [2022-02-20 14:24:56,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {943#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {943#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {943#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {943#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:56,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {858#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {851#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:24:56,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {986#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:24:56,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {825#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {986#(<= 0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:24:56,871 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {825#true} {825#true} #73#return; {825#true} is VALID [2022-02-20 14:24:56,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 14:24:56,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {825#true} assume !(0 == ~cond); {825#true} is VALID [2022-02-20 14:24:56,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 14:24:56,872 INFO L272 TraceCheckUtils]: 2: Hoare triple {825#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {825#true} is VALID [2022-02-20 14:24:56,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {825#true} is VALID [2022-02-20 14:24:56,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {825#true} is VALID [2022-02-20 14:24:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:56,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:56,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17529016] [2022-02-20 14:24:56,873 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:56,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424909863] [2022-02-20 14:24:56,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424909863] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:56,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:56,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-02-20 14:24:56,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960136919] [2022-02-20 14:24:56,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:56,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 14:24:56,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:56,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:56,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:56,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:24:56,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:24:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:24:56,922 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,268 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 14:24:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:24:57,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 14:24:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-02-20 14:24:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-02-20 14:24:57,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-02-20 14:24:57,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,308 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:24:57,308 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:24:57,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:24:57,310 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:57,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:24:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 14:24:57,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:57,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:57,338 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:57,338 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,341 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-20 14:24:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-02-20 14:24:57,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 14:24:57,342 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-02-20 14:24:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,350 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-20 14:24:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-02-20 14:24:57,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:57,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-02-20 14:24:57,352 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2022-02-20 14:24:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:57,353 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-02-20 14:24:57,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-02-20 14:24:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:24:57,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,354 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:57,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:57,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:57,573 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1722352949, now seen corresponding path program 3 times [2022-02-20 14:24:57,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019815339] [2022-02-20 14:24:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:57,618 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:57,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579569234] [2022-02-20 14:24:57,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:24:57,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:57,621 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) [2022-02-20 14:24:57,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:24:57,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:24:57,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:24:57,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 74 conjunts are in the unsatisfiable core [2022-02-20 14:24:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:57,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:24:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:57,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-02-20 14:24:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-02-20 14:24:57,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-02-20 14:24:58,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 14:24:58,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-02-20 14:24:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-02-20 14:24:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2022-02-20 14:24:58,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,187 INFO L356 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-02-20 14:24:58,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2022-02-20 14:24:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,217 INFO L356 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-02-20 14:24:58,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2022-02-20 14:25:00,687 INFO L356 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2022-02-20 14:25:00,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 334 treesize of output 217 [2022-02-20 14:25:00,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:00,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 130 [2022-02-20 14:25:00,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 151 [2022-02-20 14:25:00,961 INFO L356 Elim1Store]: treesize reduction 116, result has 4.1 percent of original size [2022-02-20 14:25:00,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 176 treesize of output 219 [2022-02-20 14:25:01,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,074 INFO L356 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-02-20 14:25:01,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 160 [2022-02-20 14:25:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:01,230 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-02-20 14:25:01,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 82 [2022-02-20 14:25:01,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-02-20 14:25:01,560 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-02-20 14:25:01,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 182 [2022-02-20 14:25:14,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:25:14,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 120 [2022-02-20 14:25:14,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,670 INFO L356 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2022-02-20 14:25:14,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 140 [2022-02-20 14:25:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:14,899 INFO L356 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2022-02-20 14:25:14,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 201 [2022-02-20 14:25:18,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L272 TraceCheckUtils]: 2: Hoare triple {1195#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {1195#true} ~cond := #in~cond; {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {1195#true} assume !(0 == ~cond); {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1195#true} assume true; {1195#true} is VALID [2022-02-20 14:25:18,807 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1195#true} {1195#true} #73#return; {1195#true} is VALID [2022-02-20 14:25:18,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1221#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1225#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (* |ULTIMATE.start_main_~num~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (* |ULTIMATE.start_main_~num~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1229#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {1229#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1233#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1233#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1233#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {1233#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1240#(and (= |ULTIMATE.start_main_~count~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (* (- 1) |ULTIMATE.start_main_~count~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1240#(and (= |ULTIMATE.start_main_~count~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (* (- 1) |ULTIMATE.start_main_~count~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1244#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= |ULTIMATE.start_main_~count~0#1| (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {1244#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= |ULTIMATE.start_main_~count~0#1| (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1248#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1248#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:18,824 INFO L272 TraceCheckUtils]: 16: Hoare triple {1248#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {1255#(exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|))))} is VALID [2022-02-20 14:25:18,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#(exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {1259#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} is VALID [2022-02-20 14:25:18,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {1259#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} assume !(0 == ~cond); {1263#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} is VALID [2022-02-20 14:25:18,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {1263#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} assume true; {1263#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} is VALID [2022-02-20 14:25:18,830 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1263#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 4) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0) (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|) (* |v_ULTIMATE.start_main_~count~0#1_28| 4)) |v_ULTIMATE.start_main_~count~0#1_28|) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} {1248#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4))) (* (- 1) |v_ULTIMATE.start_main_~count~0#1_28|)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #75#return; {1270#(and (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (= (+ |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) 0) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))))} is VALID [2022-02-20 14:25:18,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#(and (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (<= ~ARR_SIZE~0 (+ |v_ULTIMATE.start_main_~count~0#1_28| 1)) (= |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) (= (+ |v_ULTIMATE.start_main_~count~0#1_28| (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_28| 4)))) 0) (< |v_ULTIMATE.start_main_~count~0#1_28| ~ARR_SIZE~0))))} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1274#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1274#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} assume 0 == main_~temp~0#1; {1274#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {1274#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} main_~count~0#1 := 0; {1281#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {1281#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1281#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {1281#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1288#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {1288#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1292#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {1292#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4)))) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1296#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~count~0#1| 2) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} is VALID [2022-02-20 14:25:18,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {1296#(and (exists ((v_DerPreprocessor_4 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_arrayElimCell_31 Int)) (and (<= ~ARR_SIZE~0 (+ v_arrayElimCell_31 1)) (< (+ |ULTIMATE.start_main_~index~0#1| 1) ~ARR_SIZE~0) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) 0) (< v_arrayElimCell_31 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4))))) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)) v_DerPreprocessor_4) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (< 0 |ULTIMATE.start_main_~index~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 v_arrayElimCell_31))) v_arrayElimCell_31) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) 4)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|) (- 4)))))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~count~0#1| 2) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1300#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (exists ((v_arrayElimCell_52 Int)) (and (< 0 (+ ~ARR_SIZE~0 v_arrayElimCell_52)) (<= (+ ~ARR_SIZE~0 v_arrayElimCell_52) 1) (or (and (< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (< 3 ~ARR_SIZE~0) (not (= 4 (* |ULTIMATE.start_main_~count~0#1| 4)))) (and (= (* 2 |ULTIMATE.start_main_~sum~0#1|) |ULTIMATE.start_main_~sum~0#1|) (< 2 ~ARR_SIZE~0)) (and (not (= 4 (* |ULTIMATE.start_main_~count~0#1| 4))) (or (and (not (= 0 (* |ULTIMATE.start_main_~count~0#1| 4))) (< 2 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~count~0#1| 2)) (and (= (+ |ULTIMATE.start_main_~sum~0#1| v_arrayElimCell_52) v_arrayElimCell_52) (< 2 ~ARR_SIZE~0)))) (and (not (= (* (- 4) v_arrayElimCell_52) 8)) (= (mod |ULTIMATE.start_main_~sum~0#1| 2) 0) (< 2 ~ARR_SIZE~0))))))} is VALID [2022-02-20 14:25:18,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {1300#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (exists ((v_arrayElimCell_52 Int)) (and (< 0 (+ ~ARR_SIZE~0 v_arrayElimCell_52)) (<= (+ ~ARR_SIZE~0 v_arrayElimCell_52) 1) (or (and (< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (< 3 ~ARR_SIZE~0) (not (= 4 (* |ULTIMATE.start_main_~count~0#1| 4)))) (and (= (* 2 |ULTIMATE.start_main_~sum~0#1|) |ULTIMATE.start_main_~sum~0#1|) (< 2 ~ARR_SIZE~0)) (and (not (= 4 (* |ULTIMATE.start_main_~count~0#1| 4))) (or (and (not (= 0 (* |ULTIMATE.start_main_~count~0#1| 4))) (< 2 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~count~0#1| 2)) (and (= (+ |ULTIMATE.start_main_~sum~0#1| v_arrayElimCell_52) v_arrayElimCell_52) (< 2 ~ARR_SIZE~0)))) (and (not (= (* (- 4) v_arrayElimCell_52) 8)) (= (mod |ULTIMATE.start_main_~sum~0#1| 2) 0) (< 2 ~ARR_SIZE~0))))))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1304#(or (and (<= |ULTIMATE.start_main_~count~0#1| 3) (= (mod |ULTIMATE.start_main_~sum~0#1| 2) 0) (< 3 ~ARR_SIZE~0)) (and (< 2 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~count~0#1| 1)) (and (< 3 ~ARR_SIZE~0) (or (and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 4 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| 2))) (and (<= |ULTIMATE.start_main_~count~0#1| 3) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:25:18,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {1304#(or (and (<= |ULTIMATE.start_main_~count~0#1| 3) (= (mod |ULTIMATE.start_main_~sum~0#1| 2) 0) (< 3 ~ARR_SIZE~0)) (and (< 2 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~count~0#1| 1)) (and (< 3 ~ARR_SIZE~0) (or (and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 4 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| 2))) (and (<= |ULTIMATE.start_main_~count~0#1| 3) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1308#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:25:18,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1312#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:18,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1196#false} is VALID [2022-02-20 14:25:18,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {1196#false} assume !false; {1196#false} is VALID [2022-02-20 14:25:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:18,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:32,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:32,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019815339] [2022-02-20 14:25:32,552 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:32,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579569234] [2022-02-20 14:25:32,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579569234] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:32,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:32,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-02-20 14:25:32,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965085309] [2022-02-20 14:25:32,553 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-02-20 14:25:32,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:32,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:32,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:32,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:25:32,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:25:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=827, Unknown=17, NotChecked=0, Total=992 [2022-02-20 14:25:32,655 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:40,631 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-02-20 14:25:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 14:25:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-02-20 14:25:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 56 transitions. [2022-02-20 14:25:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 56 transitions. [2022-02-20 14:25:40,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 56 transitions. [2022-02-20 14:25:40,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:40,762 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:25:40,762 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 14:25:40,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=160, Invalid=945, Unknown=17, NotChecked=0, Total=1122 [2022-02-20 14:25:40,764 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:40,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 135 Unchecked, 0.0s Time] [2022-02-20 14:25:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 14:25:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-02-20 14:25:40,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:40,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:40,814 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:40,814 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:40,816 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-02-20 14:25:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-02-20 14:25:40,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:40,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:40,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-02-20 14:25:40,817 INFO L87 Difference]: Start difference. First operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-02-20 14:25:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:40,819 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-02-20 14:25:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-02-20 14:25:40,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:40,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:40,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:40,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-02-20 14:25:40,822 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 34 [2022-02-20 14:25:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:40,822 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-02-20 14:25:40,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 14:25:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:25:40,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:40,824 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:40,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:41,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:41,025 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1565541619, now seen corresponding path program 4 times [2022-02-20 14:25:41,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:41,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993075128] [2022-02-20 14:25:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:41,043 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:41,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557159937] [2022-02-20 14:25:41,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:25:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:41,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:41,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:25:41,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:25:41,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:41,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:25:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:41,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:41,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L272 TraceCheckUtils]: 2: Hoare triple {1627#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} ~cond := #in~cond; {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {1627#true} assume !(0 == ~cond); {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 14:25:41,409 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1627#true} {1627#true} #73#return; {1627#true} is VALID [2022-02-20 14:25:41,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:41,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:41,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:41,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:41,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:41,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:41,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1674#(<= |ULTIMATE.start_main_~count~0#1| 3)} is VALID [2022-02-20 14:25:41,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {1674#(<= |ULTIMATE.start_main_~count~0#1| 3)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,416 INFO L272 TraceCheckUtils]: 16: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} ~cond := #in~cond; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume !(0 == ~cond); {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume true; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,417 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1678#(<= ~ARR_SIZE~0 3)} {1678#(<= ~ARR_SIZE~0 3)} #75#return; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume 0 == main_~temp~0#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} main_~count~0#1 := 0; {1706#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1706#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1706#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {1706#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1713#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {1713#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1713#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {1713#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1720#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {1720#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1720#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {1720#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1727#(and (<= 3 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} is VALID [2022-02-20 14:25:41,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1727#(and (<= 3 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 3))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1628#false} is VALID [2022-02-20 14:25:41,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1628#false} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1628#false} is VALID [2022-02-20 14:25:41,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {1628#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1628#false} is VALID [2022-02-20 14:25:41,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {1628#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1628#false} is VALID [2022-02-20 14:25:41,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {1628#false} assume 0 == __VERIFIER_assert_~cond#1; {1628#false} is VALID [2022-02-20 14:25:41,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {1628#false} assume !false; {1628#false} is VALID [2022-02-20 14:25:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:41,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:41,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {1628#false} assume !false; {1628#false} is VALID [2022-02-20 14:25:41,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {1628#false} assume 0 == __VERIFIER_assert_~cond#1; {1628#false} is VALID [2022-02-20 14:25:41,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {1628#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1628#false} is VALID [2022-02-20 14:25:41,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {1628#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1628#false} is VALID [2022-02-20 14:25:41,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {1628#false} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1628#false} is VALID [2022-02-20 14:25:41,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {1761#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1628#false} is VALID [2022-02-20 14:25:41,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {1765#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1761#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:41,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {1765#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1765#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:41,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {1772#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1765#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:41,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {1772#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1772#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:41,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {1779#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 3))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1772#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:41,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {1779#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 3))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1779#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 3))} is VALID [2022-02-20 14:25:41,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} main_~count~0#1 := 0; {1779#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 3))} is VALID [2022-02-20 14:25:41,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume 0 == main_~temp~0#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,666 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1627#true} {1678#(<= ~ARR_SIZE~0 3)} #75#return; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 14:25:41,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {1627#true} assume !(0 == ~cond); {1627#true} is VALID [2022-02-20 14:25:41,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#true} ~cond := #in~cond; {1627#true} is VALID [2022-02-20 14:25:41,666 INFO L272 TraceCheckUtils]: 16: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {1627#true} is VALID [2022-02-20 14:25:41,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {1678#(<= ~ARR_SIZE~0 3)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {1674#(<= |ULTIMATE.start_main_~count~0#1| 3)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1678#(<= ~ARR_SIZE~0 3)} is VALID [2022-02-20 14:25:41,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1674#(<= |ULTIMATE.start_main_~count~0#1| 3)} is VALID [2022-02-20 14:25:41,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:41,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1667#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:41,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:41,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1660#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:41,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:41,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1653#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:41,672 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1627#true} {1627#true} #73#return; {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume true; {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {1627#true} assume !(0 == ~cond); {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} ~cond := #in~cond; {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L272 TraceCheckUtils]: 2: Hoare triple {1627#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1627#true} is VALID [2022-02-20 14:25:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:41,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:41,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993075128] [2022-02-20 14:25:41,673 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:41,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557159937] [2022-02-20 14:25:41,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557159937] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:41,673 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:41,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-02-20 14:25:41,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892125139] [2022-02-20 14:25:41,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:25:41,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:41,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:41,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:41,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:25:41,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:25:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:25:41,723 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:42,229 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-02-20 14:25:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:25:42,230 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:25:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-02-20 14:25:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-02-20 14:25:42,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 72 transitions. [2022-02-20 14:25:42,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:42,299 INFO L225 Difference]: With dead ends: 87 [2022-02-20 14:25:42,299 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 14:25:42,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:25:42,300 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:42,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 14:25:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-02-20 14:25:42,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:42,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:42,383 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:42,384 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:42,385 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-02-20 14:25:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-02-20 14:25:42,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:42,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:42,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 73 states. [2022-02-20 14:25:42,387 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 73 states. [2022-02-20 14:25:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:42,389 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-02-20 14:25:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-02-20 14:25:42,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:42,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:42,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:42,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-20 14:25:42,392 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 36 [2022-02-20 14:25:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:42,392 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-20 14:25:42,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-20 14:25:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:25:42,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:42,393 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:42,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:42,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:42,606 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -956776499, now seen corresponding path program 5 times [2022-02-20 14:25:42,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:42,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806693093] [2022-02-20 14:25:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:42,624 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:42,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500782679] [2022-02-20 14:25:42,624 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:25:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:42,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:42,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:42,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:25:42,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 14:25:42,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:25:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:42,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:43,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {2206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {2206#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {2206#true} ~cond := #in~cond; {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {2206#true} assume !(0 == ~cond); {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-02-20 14:25:43,078 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2206#true} {2206#true} #73#return; {2206#true} is VALID [2022-02-20 14:25:43,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {2206#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2253#(<= 3 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2253#(<= 3 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,085 INFO L272 TraceCheckUtils]: 18: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} ~cond := #in~cond; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume !(0 == ~cond); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume true; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,087 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2257#(< 3 ~ARR_SIZE~0)} {2257#(< 3 ~ARR_SIZE~0)} #75#return; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} main_~count~0#1 := 0; {2291#(and (< 3 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:43,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {2291#(and (< 3 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2291#(and (< 3 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:43,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {2291#(and (< 3 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2298#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 3 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {2298#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 3 ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2298#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 3 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {2298#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 3 ~ARR_SIZE~0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2305#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 3 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 3 ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2305#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 3 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {2305#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 3 ~ARR_SIZE~0))} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2312#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 3 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {2312#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 3 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2207#false} is VALID [2022-02-20 14:25:43,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {2207#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2207#false} is VALID [2022-02-20 14:25:43,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {2207#false} assume 0 == __VERIFIER_assert_~cond#1; {2207#false} is VALID [2022-02-20 14:25:43,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-02-20 14:25:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:43,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:43,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-02-20 14:25:43,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {2207#false} assume 0 == __VERIFIER_assert_~cond#1; {2207#false} is VALID [2022-02-20 14:25:43,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {2207#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2207#false} is VALID [2022-02-20 14:25:43,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {2334#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2207#false} is VALID [2022-02-20 14:25:43,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {2338#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2334#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {2338#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2338#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {2345#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2338#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {2345#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2345#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {2352#(< (+ |ULTIMATE.start_main_~count~0#1| 3) ~ARR_SIZE~0)} main_#t~post12#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2345#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {2352#(< (+ |ULTIMATE.start_main_~count~0#1| 3) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem13#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem14#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem13#1 + main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2352#(< (+ |ULTIMATE.start_main_~count~0#1| 3) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} main_~count~0#1 := 0; {2352#(< (+ |ULTIMATE.start_main_~count~0#1| 3) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} call main_#t~mem7#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem8#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem7#1 + main_#t~mem8#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (main_~index~0#1 - 1), 4);call main_#t~mem10#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (1 + main_~index~0#1), 4);call write~int(main_#t~mem9#1 + main_#t~mem10#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~mem9#1;havoc main_#t~mem10#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,323 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2206#true} {2257#(< 3 ~ARR_SIZE~0)} #75#return; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-02-20 14:25:43,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {2206#true} assume !(0 == ~cond); {2206#true} is VALID [2022-02-20 14:25:43,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#true} ~cond := #in~cond; {2206#true} is VALID [2022-02-20 14:25:43,323 INFO L272 TraceCheckUtils]: 18: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 > 0 && main_~index~0#1 < ~ARR_SIZE~0 - 1 then 1 else 0)); {2206#true} is VALID [2022-02-20 14:25:43,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {2257#(< 3 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {2253#(<= 3 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2257#(< 3 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:43,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2253#(<= 3 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2246#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2239#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {2206#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2232#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:43,333 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2206#true} {2206#true} #73#return; {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {2206#true} assume !(0 == ~cond); {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {2206#true} ~cond := #in~cond; {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L272 TraceCheckUtils]: 2: Hoare triple {2206#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~nondet11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2206#true} is VALID [2022-02-20 14:25:43,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {2206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2206#true} is VALID [2022-02-20 14:25:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:43,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:43,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806693093] [2022-02-20 14:25:43,334 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:43,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500782679] [2022-02-20 14:25:43,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500782679] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:43,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:43,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-02-20 14:25:43,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652238408] [2022-02-20 14:25:43,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:25:43,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:43,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:43,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:43,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:25:43,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:25:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:25:43,381 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:43,949 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 14:25:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:25:43,949 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-20 14:25:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-02-20 14:25:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-02-20 14:25:43,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-02-20 14:25:44,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:44,019 INFO L225 Difference]: With dead ends: 72 [2022-02-20 14:25:44,019 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 14:25:44,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:25:44,020 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:44,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 108 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:25:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 14:25:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-02-20 14:25:44,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:44,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:44,115 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:44,116 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:44,118 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-02-20 14:25:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 14:25:44,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:44,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:44,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 68 states. [2022-02-20 14:25:44,119 INFO L87 Difference]: Start difference. First operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 68 states. [2022-02-20 14:25:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:44,121 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-02-20 14:25:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 14:25:44,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:44,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:44,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:44,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-02-20 14:25:44,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 36 [2022-02-20 14:25:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:44,123 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-02-20 14:25:44,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-02-20 14:25:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:25:44,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:44,124 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 14:25:44,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:44,340 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -285980785, now seen corresponding path program 6 times [2022-02-20 14:25:44,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:44,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125492891] [2022-02-20 14:25:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:44,372 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:44,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768422924] [2022-02-20 14:25:44,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:25:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:44,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:44,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:25:44,650 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-02-20 14:25:44,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:44,652 WARN L261 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 93 conjunts are in the unsatisfiable core [2022-02-20 14:25:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:44,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:44,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:25:44,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:44,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-02-20 14:25:44,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-02-20 14:25:44,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-02-20 14:25:44,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:44,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-02-20 14:25:44,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:44,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-02-20 14:25:44,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:44,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:44,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-02-20 14:25:45,062 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-02-20 14:25:45,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 88 [2022-02-20 14:25:45,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2022-02-20 14:25:45,083 INFO L356 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2022-02-20 14:25:45,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 75 [2022-02-20 14:25:45,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2022-02-20 14:25:45,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:45,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40