./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array11_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/array11_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 c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:26,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:26,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:26,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:26,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:26,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:26,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:26,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:26,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:26,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:26,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:26,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:26,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:26,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:26,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:26,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:26,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:26,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:26,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:26,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:26,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:26,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:26,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:26,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:26,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:26,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:26,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:26,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:26,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:26,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:26,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:26,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:26,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:26,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:26,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:26,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:26,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:26,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:26,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:26,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:26,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:26,998 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:22:27,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:27,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:27,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:27,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:27,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:27,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:27,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:27,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:27,035 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:27,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:27,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:27,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:27,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:27,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:27,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:27,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:27,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:27,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:27,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:27,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:27,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:27,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:27,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:27,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:27,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:27,040 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:27,040 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:27,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:27,040 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 -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb [2022-02-20 14:22:27,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:27,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:27,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:27,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:27,318 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:27,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array11_pattern.c [2022-02-20 14:22:27,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3279b47/c314ec7ff2f64f7e946fd353cc7a918b/FLAGde68c3de8 [2022-02-20 14:22:27,753 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:27,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c [2022-02-20 14:22:27,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3279b47/c314ec7ff2f64f7e946fd353cc7a918b/FLAGde68c3de8 [2022-02-20 14:22:28,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3279b47/c314ec7ff2f64f7e946fd353cc7a918b [2022-02-20 14:22:28,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:28,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:28,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:28,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:28,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:28,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1d5b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28, skipping insertion in model container [2022-02-20 14:22:28,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:28,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:28,344 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/array11_pattern.c[1357,1370] [2022-02-20 14:22:28,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:28,368 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:28,377 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/array11_pattern.c[1357,1370] [2022-02-20 14:22:28,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:28,398 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:28,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28 WrapperNode [2022-02-20 14:22:28,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:28,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:28,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:28,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:28,406 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:22:28" (1/1) ... [2022-02-20 14:22:28,419 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:22:28" (1/1) ... [2022-02-20 14:22:28,453 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-02-20 14:22:28,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:28,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:28,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:28,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:28,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:28,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:28,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:28,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:28,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (1/1) ... [2022-02-20 14:22:28,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:28,523 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:22:28,530 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:22:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:28,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:28,615 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:28,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:28,866 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:28,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:28,872 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:22:28,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:28 BoogieIcfgContainer [2022-02-20 14:22:28,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:28,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:28,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:28,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:28,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:28" (1/3) ... [2022-02-20 14:22:28,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c2e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:28, skipping insertion in model container [2022-02-20 14:22:28,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:28" (2/3) ... [2022-02-20 14:22:28,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c2e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:28, skipping insertion in model container [2022-02-20 14:22:28,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:28" (3/3) ... [2022-02-20 14:22:28,881 INFO L111 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2022-02-20 14:22:28,888 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:28,888 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:28,953 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:28,966 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:22:28,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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:22:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:28,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:28,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:28,994 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1199380475, now seen corresponding path program 1 times [2022-02-20 14:22:29,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:29,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830917631] [2022-02-20 14:22:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:29,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:22:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:29,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 14:22:29,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 14:22:29,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 14:22:29,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #80#return; {31#false} is VALID [2022-02-20 14:22:29,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {30#true} is VALID [2022-02-20 14:22:29,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {30#true} is VALID [2022-02-20 14:22:29,240 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {30#true} is VALID [2022-02-20 14:22:29,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 14:22:29,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 14:22:29,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 14:22:29,242 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#false} {30#true} #80#return; {31#false} is VALID [2022-02-20 14:22:29,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#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; {31#false} is VALID [2022-02-20 14:22:29,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2022-02-20 14:22:29,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume false; {31#false} is VALID [2022-02-20 14:22:29,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_~count~0#1 := 0; {31#false} is VALID [2022-02-20 14:22:29,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {31#false} is VALID [2022-02-20 14:22:29,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {31#false} is VALID [2022-02-20 14:22:29,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == __VERIFIER_assert_~cond#1; {31#false} is VALID [2022-02-20 14:22:29,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 14:22:29,254 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:22:29,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:29,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830917631] [2022-02-20 14:22:29,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830917631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:29,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:29,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:29,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611289374] [2022-02-20 14:22:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:29,264 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:22:29,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:29,268 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:22:29,306 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:22:29,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:29,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:29,328 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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:22:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,387 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 14:22:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:29,388 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:22:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:29,389 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:22:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:22:29,402 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:22:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:22:29,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 14:22:29,494 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:22:29,503 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:22:29,503 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:22:29,506 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:22:29,510 INFO L933 BasicCegarLoop]: 31 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, 31 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:22:29,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:22:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 14:22:29,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:29,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:22:29,531 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:22:29,531 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:22:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,534 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:22:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:29,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 23 states. [2022-02-20 14:22:29,536 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 23 states. [2022-02-20 14:22:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,538 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:22:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:29,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:29,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:22:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:22:29,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-02-20 14:22:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:29,543 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:22:29,543 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:22:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:22:29,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:29,544 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:22:29,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:22:29,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 966180883, now seen corresponding path program 1 times [2022-02-20 14:22:29,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:29,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83823377] [2022-02-20 14:22:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:29,579 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:29,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210822508] [2022-02-20 14:22:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:29,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:29,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:29,584 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:22:29,587 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:22:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:29,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:22:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:29,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:29,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {174#true} is VALID [2022-02-20 14:22:29,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {174#true} is VALID [2022-02-20 14:22:29,799 INFO L272 TraceCheckUtils]: 2: Hoare triple {174#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {174#true} is VALID [2022-02-20 14:22:29,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {174#true} ~cond := #in~cond; {174#true} is VALID [2022-02-20 14:22:29,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {174#true} assume !(0 == ~cond); {174#true} is VALID [2022-02-20 14:22:29,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {174#true} assume true; {174#true} is VALID [2022-02-20 14:22:29,800 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {174#true} {174#true} #80#return; {174#true} is VALID [2022-02-20 14:22:29,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#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; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#(= |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; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,801 INFO L272 TraceCheckUtils]: 10: Hoare triple {200#(= |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 then 1 else 0)); {174#true} is VALID [2022-02-20 14:22:29,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#true} ~cond := #in~cond; {174#true} is VALID [2022-02-20 14:22:29,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#true} assume !(0 == ~cond); {174#true} is VALID [2022-02-20 14:22:29,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#true} assume true; {174#true} is VALID [2022-02-20 14:22:29,803 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {174#true} {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} #82#return; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int((if main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 <= 2147483647 then main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 else main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 - 4294967296), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4); {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~index~0#1 == ~ARR_SIZE~0 - 1);main_#t~ite7#1 := main_~num~0#1 * main_~index~0#1; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int((if main_#t~ite7#1 % 4294967296 <= 2147483647 then main_#t~ite7#1 % 4294967296 else main_#t~ite7#1 % 4294967296 - 4294967296), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~count~0#1 := 0; {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:22:29,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {200#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {243#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:29,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {243#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:22:29,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:22:29,808 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:22:29,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:29,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:29,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83823377] [2022-02-20 14:22:29,809 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:29,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210822508] [2022-02-20 14:22:29,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210822508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:29,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:29,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:22:29,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679704601] [2022-02-20 14:22:29,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:29,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:29,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,847 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:22:29,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:22:29,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:22:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:22:29,850 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,931 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-20 14:22:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:22:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:22:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:22:29,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 14:22:29,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:29,971 INFO L225 Difference]: With dead ends: 28 [2022-02-20 14:22:29,971 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:22:29,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:22:29,974 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 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:22:29,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:22:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:22:29,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:29,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:22:29,981 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:22:29,983 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:22:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,986 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:22:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:22:29,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 24 states. [2022-02-20 14:22:29,988 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 24 states. [2022-02-20 14:22:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,991 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:22:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:22:29,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:29,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:22:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:22:29,994 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 24 [2022-02-20 14:22:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:29,994 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:22:29,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:22:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:22:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:22:29,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:29,996 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:22:30,022 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:22:30,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:30,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 840126261, now seen corresponding path program 1 times [2022-02-20 14:22:30,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:30,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149627909] [2022-02-20 14:22:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:30,252 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:30,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160362587] [2022-02-20 14:22:30,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:30,254 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:22:30,288 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:22:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:30,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:22:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:30,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:30,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {363#true} is VALID [2022-02-20 14:22:30,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {363#true} is VALID [2022-02-20 14:22:30,479 INFO L272 TraceCheckUtils]: 2: Hoare triple {363#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {363#true} is VALID [2022-02-20 14:22:30,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {363#true} ~cond := #in~cond; {363#true} is VALID [2022-02-20 14:22:30,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {363#true} assume !(0 == ~cond); {363#true} is VALID [2022-02-20 14:22:30,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} assume true; {363#true} is VALID [2022-02-20 14:22:30,480 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {363#true} {363#true} #80#return; {363#true} is VALID [2022-02-20 14:22:30,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#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; {389#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:22:30,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#(<= ~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; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,483 INFO L272 TraceCheckUtils]: 10: Hoare triple {393#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {393#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(<= ~ARR_SIZE~0 0)} assume true; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,485 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {393#(<= ~ARR_SIZE~0 0)} {393#(<= ~ARR_SIZE~0 0)} #82#return; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {393#(<= ~ARR_SIZE~0 0)} call write~int((if main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 <= 2147483647 then main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 else main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 - 4294967296), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4); {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {393#(<= ~ARR_SIZE~0 0)} assume !(main_~index~0#1 == ~ARR_SIZE~0 - 1);main_#t~ite7#1 := main_~num~0#1 * main_~index~0#1; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#(<= ~ARR_SIZE~0 0)} call write~int((if main_#t~ite7#1 % 4294967296 <= 2147483647 then main_#t~ite7#1 % 4294967296 else main_#t~ite7#1 % 4294967296 - 4294967296), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {393#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:22:30,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {393#(<= ~ARR_SIZE~0 0)} main_~count~0#1 := 0; {427#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 0))} is VALID [2022-02-20 14:22:30,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {427#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#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~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {364#false} is VALID [2022-02-20 14:22:30,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {364#false} is VALID [2022-02-20 14:22:30,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {364#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {364#false} is VALID [2022-02-20 14:22:30,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {364#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {364#false} is VALID [2022-02-20 14:22:30,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {364#false} assume 0 == __VERIFIER_assert_~cond#1; {364#false} is VALID [2022-02-20 14:22:30,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-02-20 14:22:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:30,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:30,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:30,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149627909] [2022-02-20 14:22:30,490 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:30,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160362587] [2022-02-20 14:22:30,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160362587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:30,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:30,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:22:30,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944162974] [2022-02-20 14:22:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:30,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2022-02-20 14:22:30,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:30,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:22:30,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:30,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:22:30,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:22:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:22:30,515 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:22:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,690 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-20 14:22:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:22:30,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2022-02-20 14:22:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:22:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 14:22:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:22:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 14:22:30,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-02-20 14:22:30,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:30,744 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:22:30,745 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:22:30,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:22:30,746 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:30,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:22:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-20 14:22:30,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:30,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:22:30,751 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:22:30,752 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:22:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,753 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:22:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:22:30,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:30,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:30,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 27 states. [2022-02-20 14:22:30,755 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 27 states. [2022-02-20 14:22:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,756 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:22:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:22:30,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:30,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:30,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:30,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:22:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 14:22:30,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-02-20 14:22:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:30,759 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 14:22:30,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:22:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 14:22:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:30,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:30,761 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, 1, 1] [2022-02-20 14:22:30,787 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:22:30,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:22:30,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash -760544265, now seen corresponding path program 1 times [2022-02-20 14:22:30,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:30,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613448939] [2022-02-20 14:22:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:31,017 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:31,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522439115] [2022-02-20 14:22:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:31,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:31,020 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:22:31,044 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:22:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:31,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 14:22:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:31,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:31,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {591#true} is VALID [2022-02-20 14:22:31,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {591#true} is VALID [2022-02-20 14:22:31,419 INFO L272 TraceCheckUtils]: 2: Hoare triple {591#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {591#true} is VALID [2022-02-20 14:22:31,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#true} ~cond := #in~cond; {591#true} is VALID [2022-02-20 14:22:31,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {591#true} assume !(0 == ~cond); {591#true} is VALID [2022-02-20 14:22:31,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {591#true} assume true; {591#true} is VALID [2022-02-20 14:22:31,419 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {591#true} {591#true} #80#return; {591#true} is VALID [2022-02-20 14:22:31,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#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; {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:22:31,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:22:31,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {617#(<= |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; {624#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:22:31,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {624#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {628#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:31,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#(<= ~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; {628#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:31,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {628#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {628#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:31,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {638#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:22:31,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {642#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:31,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {642#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:22:31,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {642#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {628#(<= ~ARR_SIZE~0 1)} #82#return; {649#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:31,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {649#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))} call write~int((if main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 <= 2147483647 then main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 else main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 - 4294967296), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4); {649#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:31,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))} assume !(main_~index~0#1 == ~ARR_SIZE~0 - 1);main_#t~ite7#1 := main_~num~0#1 * main_~index~0#1; {592#false} is VALID [2022-02-20 14:22:31,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#false} call write~int((if main_#t~ite7#1 % 4294967296 <= 2147483647 then main_#t~ite7#1 % 4294967296 else main_#t~ite7#1 % 4294967296 - 4294967296), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {592#false} is VALID [2022-02-20 14:22:31,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {592#false} assume 0 == main_~temp~0#1; {592#false} is VALID [2022-02-20 14:22:31,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {592#false} main_~count~0#1 := 0; {592#false} is VALID [2022-02-20 14:22:31,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {592#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#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~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {592#false} is VALID [2022-02-20 14:22:31,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {592#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {592#false} is VALID [2022-02-20 14:22:31,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {592#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {592#false} is VALID [2022-02-20 14:22:31,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {592#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {592#false} is VALID [2022-02-20 14:22:31,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {592#false} assume 0 == __VERIFIER_assert_~cond#1; {592#false} is VALID [2022-02-20 14:22:31,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {592#false} assume !false; {592#false} is VALID [2022-02-20 14:22:31,435 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:22:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:31,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {592#false} assume !false; {592#false} is VALID [2022-02-20 14:22:31,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {592#false} assume 0 == __VERIFIER_assert_~cond#1; {592#false} is VALID [2022-02-20 14:22:31,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {592#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {592#false} is VALID [2022-02-20 14:22:31,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {592#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {592#false} is VALID [2022-02-20 14:22:31,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {592#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {592#false} is VALID [2022-02-20 14:22:31,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {592#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#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~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {592#false} is VALID [2022-02-20 14:22:31,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {592#false} main_~count~0#1 := 0; {592#false} is VALID [2022-02-20 14:22:31,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {592#false} assume 0 == main_~temp~0#1; {592#false} is VALID [2022-02-20 14:22:31,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#false} call write~int((if main_#t~ite7#1 % 4294967296 <= 2147483647 then main_#t~ite7#1 % 4294967296 else main_#t~ite7#1 % 4294967296 - 4294967296), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {592#false} is VALID [2022-02-20 14:22:31,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|)} assume !(main_~index~0#1 == ~ARR_SIZE~0 - 1);main_#t~ite7#1 := main_~num~0#1 * main_~index~0#1; {592#false} is VALID [2022-02-20 14:22:31,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|)} call write~int((if main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 <= 2147483647 then main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 else main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 - 4294967296), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4); {710#(= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|)} is VALID [2022-02-20 14:22:31,877 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {720#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} {628#(<= ~ARR_SIZE~0 1)} #82#return; {710#(= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|)} is VALID [2022-02-20 14:22:31,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {720#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} assume true; {720#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:31,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (not (<= ~ARR_SIZE~0 1)))} assume !(0 == ~cond); {720#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:31,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {591#true} ~cond := #in~cond; {727#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:22:31,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {628#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {591#true} is VALID [2022-02-20 14:22:31,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#(<= ~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; {628#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:31,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {624#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {628#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:22:31,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {617#(<= |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; {624#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:22:31,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:22:31,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#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; {617#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:22:31,883 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {591#true} {591#true} #80#return; {591#true} is VALID [2022-02-20 14:22:31,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {591#true} assume true; {591#true} is VALID [2022-02-20 14:22:31,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {591#true} assume !(0 == ~cond); {591#true} is VALID [2022-02-20 14:22:31,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#true} ~cond := #in~cond; {591#true} is VALID [2022-02-20 14:22:31,884 INFO L272 TraceCheckUtils]: 2: Hoare triple {591#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {591#true} is VALID [2022-02-20 14:22:31,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {591#true} is VALID [2022-02-20 14:22:31,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {591#true} is VALID [2022-02-20 14:22:31,885 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:22:31,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:31,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613448939] [2022-02-20 14:22:31,885 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:31,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522439115] [2022-02-20 14:22:31,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522439115] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:31,886 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:31,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-02-20 14:22:31,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233131252] [2022-02-20 14:22:31,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:31,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:31,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:31,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:31,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:31,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:22:31,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:22:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:22:31,915 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:32,382 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-02-20 14:22:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:22:32,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-02-20 14:22:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2022-02-20 14:22:32,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2022-02-20 14:22:32,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:32,476 INFO L225 Difference]: With dead ends: 90 [2022-02-20 14:22:32,476 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 14:22:32,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-02-20 14:22:32,477 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:32,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 111 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:22:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 14:22:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 37. [2022-02-20 14:22:32,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:32,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:22:32,490 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:22:32,490 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:22:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:32,493 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 14:22:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 14:22:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:32,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:32,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) Second operand 72 states. [2022-02-20 14:22:32,494 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) Second operand 72 states. [2022-02-20 14:22:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:32,497 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 14:22:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 14:22:32,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:32,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:32,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:32,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:22:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-02-20 14:22:32,500 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2022-02-20 14:22:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:32,500 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-02-20 14:22:32,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:22:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:32,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:32,502 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, 1, 1] [2022-02-20 14:22:32,525 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:22:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:32,711 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash -367517255, now seen corresponding path program 1 times [2022-02-20 14:22:32,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:32,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238759189] [2022-02-20 14:22:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:32,766 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:32,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478822423] [2022-02-20 14:22:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:32,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:32,776 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:22:32,777 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:22:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:32,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 14:22:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:32,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:32,928 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:22:32,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:32,968 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 27 treesize of output 31 [2022-02-20 14:22:32,977 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-02-20 14:22:32,982 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 12 treesize of output 11 [2022-02-20 14:22:32,988 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 12 treesize of output 11 [2022-02-20 14:22:33,821 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-02-20 14:22:33,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:35,849 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) 0) [2022-02-20 14:22:35,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:35,855 INFO L244 Elim1Store]: Index analysis took 2011 ms [2022-02-20 14:22:35,864 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-02-20 14:22:35,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2022-02-20 14:22:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:42,498 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 91 treesize of output 30 [2022-02-20 14:22:53,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:53,163 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 89 treesize of output 28 [2022-02-20 14:23:18,820 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2022-02-20 14:23:18,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:18,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:18,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 119 [2022-02-20 14:23:18,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:18,952 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 0 case distinctions, treesize of input 149 treesize of output 53 [2022-02-20 14:23:19,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-02-20 14:23:19,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1081#true} is VALID [2022-02-20 14:23:19,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#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~ite7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#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; {1081#true} is VALID [2022-02-20 14:23:19,352 INFO L272 TraceCheckUtils]: 2: Hoare triple {1081#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1081#true} is VALID [2022-02-20 14:23:19,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2022-02-20 14:23:19,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {1081#true} assume !(0 == ~cond); {1081#true} is VALID [2022-02-20 14:23:19,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-02-20 14:23:19,353 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1081#true} {1081#true} #80#return; {1081#true} is VALID [2022-02-20 14:23:19,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#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; {1107#(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_~#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:23:19,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1107#(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_~#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(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1111#(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| (* |ULTIMATE.start_main_~count~0#1| 4))) 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))) 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:23:19,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1111#(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| (* |ULTIMATE.start_main_~count~0#1| 4))) 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))) 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; {1115#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (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_~#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:23:19,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (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_~#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); {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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:23:19,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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; {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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:23:19,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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 then 1 else 0)); {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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:23:19,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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; {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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:23:19,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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); {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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:23:19,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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; {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (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:23:19,364 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1126#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (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)) (and (= (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) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_1|)))))} {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #82#return; {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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:23:21,373 WARN L290 TraceCheckUtils]: 17: Hoare triple {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int((if main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 <= 2147483647 then main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 else main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * (main_~num~0#1 * main_~index~0#1))) % 4294967296 - 4294967296), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4); {1142#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (or (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (<= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) 2147483647) (or (and (= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (and (not (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0))))) (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (or (and (not (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (+ (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (- 4294967296))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |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| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (+ (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (- 4294967296))))) (not (<= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) 2147483647))))) (= (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 UNKNOWN [2022-02-20 14:23:21,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {1142#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (or (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (<= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) 2147483647) (or (and (= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (and (not (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0))))) (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (or (and (not (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (+ (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (- 4294967296))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 2147483647) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |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| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4))) (+ (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (- 4294967296))))) (not (<= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) 2147483647))))) (= (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_~index~0#1 == ~ARR_SIZE~0 - 1;main_#t~ite7#1 := main_~index~0#1; {1146#(and (= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|) (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_#t~ite7#1| |ULTIMATE.start_main_~index~0#1|) (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |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_~#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:23:21,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {1146#(and (= (+ (- 1) ~ARR_SIZE~0) |ULTIMATE.start_main_~index~0#1|) (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_#t~ite7#1| |ULTIMATE.start_main_~index~0#1|) (exists ((|ULTIMATE.start_main_~num~0#1| Int)) (and (= (mod (* (* (* (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~index~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~num~0#1|) 4294967296) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 17179869184) (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |ULTIMATE.start_main_~index~0#1| 4294967296) 4)))) |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_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int((if main_#t~ite7#1 % 4294967296 <= 2147483647 then main_#t~ite7#1 % 4294967296 else main_#t~ite7#1 % 4294967296 - 4294967296), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * (if main_~index~0#1 % 4294967296 <= 2147483647 then main_~index~0#1 % 4294967296 else main_~index~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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:23:21,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == main_~temp~0#1; {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#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:23:21,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 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_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 0; {1156#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |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) (= (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:23:21,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {1156#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= ~ARR_SIZE~0 1) (= |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) (= (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);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#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~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:21,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:21,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:21,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {1160#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 2 + main_~sum~0#1 == 2 * ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1170#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:21,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {1170#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1082#false} is VALID [2022-02-20 14:23:21,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2022-02-20 14:23:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:23:21,386 INFO L328 TraceCheckSpWp]: Computing backward predicates...