./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_vector_difference_ground.i --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-examples/standard_vector_difference_ground.i -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 7263b2c7ab28b481620789bcaa79c3e966cab937e9920a12d1160d17415db571 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:09:02,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:09:02,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:09:02,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:09:02,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:09:02,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:09:02,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:09:02,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:09:02,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:09:02,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:09:02,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:09:02,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:09:02,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:09:02,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:09:02,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:09:02,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:09:02,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:09:02,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:09:02,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:09:02,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:09:02,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:09:02,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:09:02,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:09:02,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:09:02,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:09:02,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:09:02,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:09:02,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:09:02,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:09:02,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:09:02,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:09:02,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:09:02,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:09:02,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:09:02,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:09:02,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:09:02,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:09:02,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:09:02,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:09:02,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:09:02,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:09:02,727 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:09:02,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:09:02,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:09:02,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:09:02,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:09:02,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:09:02,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:09:02,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:09:02,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:09:02,754 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:09:02,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:09:02,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:09:02,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:09:02,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:09:02,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:09:02,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:09:02,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:09:02,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:09:02,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:09:02,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:09:02,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:09:02,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:09:02,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:09:02,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:09:02,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:09:02,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:02,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:09:02,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:09:02,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:09:02,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:09:02,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:09:02,759 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:09:02,759 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:09:02,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:09:02,759 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 -> 7263b2c7ab28b481620789bcaa79c3e966cab937e9920a12d1160d17415db571 [2022-02-20 14:09:02,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:09:02,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:09:02,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:09:02,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:09:02,985 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:09:02,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_vector_difference_ground.i [2022-02-20 14:09:03,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82337a957/ec3a2a3ad5e44fb8bddca7f49aebda60/FLAGb0ec662bd [2022-02-20 14:09:03,412 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:09:03,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vector_difference_ground.i [2022-02-20 14:09:03,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82337a957/ec3a2a3ad5e44fb8bddca7f49aebda60/FLAGb0ec662bd [2022-02-20 14:09:03,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82337a957/ec3a2a3ad5e44fb8bddca7f49aebda60 [2022-02-20 14:09:03,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:09:03,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:09:03,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:03,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:09:03,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:09:03,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6af88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03, skipping insertion in model container [2022-02-20 14:09:03,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:09:03,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:09:03,599 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-examples/standard_vector_difference_ground.i[826,839] [2022-02-20 14:09:03,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:03,625 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:09:03,633 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-examples/standard_vector_difference_ground.i[826,839] [2022-02-20 14:09:03,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:03,650 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:09:03,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03 WrapperNode [2022-02-20 14:09:03,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:03,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:03,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:09:03,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:09:03,656 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:09:03" (1/1) ... [2022-02-20 14:09:03,661 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:09:03" (1/1) ... [2022-02-20 14:09:03,679 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-02-20 14:09:03,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:03,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:09:03,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:09:03,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:09:03,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:09:03,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:09:03,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:09:03,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:09:03,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (1/1) ... [2022-02-20 14:09:03,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:03,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:03,744 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:09:03,770 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:09:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:09:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:09:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:09:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:09:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:09:03,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:09:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:09:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:09:03,835 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:09:03,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:09:03,968 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:09:03,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:09:03,973 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:09:03,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:03 BoogieIcfgContainer [2022-02-20 14:09:03,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:09:03,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:09:03,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:09:03,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:09:03,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:09:03" (1/3) ... [2022-02-20 14:09:03,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f9970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:03, skipping insertion in model container [2022-02-20 14:09:03,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:03" (2/3) ... [2022-02-20 14:09:03,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f9970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:03, skipping insertion in model container [2022-02-20 14:09:03,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:03" (3/3) ... [2022-02-20 14:09:03,982 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_vector_difference_ground.i [2022-02-20 14:09:03,986 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:09:03,986 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:09:04,057 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:09:04,062 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:09:04,063 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:09:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:09:04,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:04,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:04,103 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2015557098, now seen corresponding path program 1 times [2022-02-20 14:09:04,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:04,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922377688] [2022-02-20 14:09:04,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:04,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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(36, 2); {20#true} is VALID [2022-02-20 14:09:04,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {22#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:04,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {21#false} is VALID [2022-02-20 14:09:04,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#false} main_~i~0#1 := 0; {21#false} is VALID [2022-02-20 14:09:04,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} assume !(main_~i~0#1 < 100000); {21#false} is VALID [2022-02-20 14:09:04,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} havoc main_~x~0#1;main_~x~0#1 := 0; {21#false} is VALID [2022-02-20 14:09:04,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {21#false} is VALID [2022-02-20 14:09:04,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {21#false} assume 0 == __VERIFIER_assert_~cond#1; {21#false} is VALID [2022-02-20 14:09:04,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 14:09:04,301 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:09:04,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:04,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922377688] [2022-02-20 14:09:04,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922377688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:04,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:04,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:09:04,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612048777] [2022-02-20 14:09:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:04,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:04,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:04,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:04,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:09:04,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:09:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:04,375 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:04,457 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2022-02-20 14:09:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:09:04,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 14:09:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 14:09:04,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-20 14:09:04,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:04,541 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:09:04,543 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 14:09:04,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:04,550 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:04,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 14:09:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-20 14:09:04,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:04,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,579 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,579 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:04,586 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:09:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:09:04,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:04,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:04,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:09:04,588 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:09:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:04,591 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:09:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:09:04,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:04,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:04,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:04,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 14:09:04,596 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-02-20 14:09:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:04,597 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 14:09:04,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 14:09:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:09:04,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:04,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:04,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:09:04,598 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1338517781, now seen corresponding path program 1 times [2022-02-20 14:09:04,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:04,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66366494] [2022-02-20 14:09:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:04,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#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(36, 2); {119#true} is VALID [2022-02-20 14:09:04,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:04,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {121#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:04,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {122#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:04,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#false} main_~i~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {120#false} is VALID [2022-02-20 14:09:04,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} havoc main_~x~0#1;main_~x~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {120#false} is VALID [2022-02-20 14:09:04,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#false} assume 0 == __VERIFIER_assert_~cond#1; {120#false} is VALID [2022-02-20 14:09:04,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-02-20 14:09:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:04,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:04,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66366494] [2022-02-20 14:09:04,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66366494] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:04,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208237536] [2022-02-20 14:09:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:04,684 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:09:04,688 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:09:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:04,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:09:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:04,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:04,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#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(36, 2); {119#true} is VALID [2022-02-20 14:09:04,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {129#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:04,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {129#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:04,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {129#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {122#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:04,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#false} main_~i~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {120#false} is VALID [2022-02-20 14:09:04,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} havoc main_~x~0#1;main_~x~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {120#false} is VALID [2022-02-20 14:09:04,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#false} assume 0 == __VERIFIER_assert_~cond#1; {120#false} is VALID [2022-02-20 14:09:04,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-02-20 14:09:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:04,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:04,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-02-20 14:09:04,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#false} assume 0 == __VERIFIER_assert_~cond#1; {120#false} is VALID [2022-02-20 14:09:04,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {120#false} is VALID [2022-02-20 14:09:04,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} havoc main_~x~0#1;main_~x~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {120#false} is VALID [2022-02-20 14:09:04,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#false} main_~i~0#1 := 0; {120#false} is VALID [2022-02-20 14:09:04,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {181#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {120#false} is VALID [2022-02-20 14:09:04,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {181#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:04,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {185#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:04,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {185#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:04,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#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(36, 2); {119#true} is VALID [2022-02-20 14:09:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:04,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208237536] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:04,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:04,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:09:04,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141307635] [2022-02-20 14:09:04,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:04,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:09:04,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:04,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:04,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:04,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:09:04,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:09:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:04,968 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:05,063 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 14:09:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:09:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:09:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:09:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:09:05,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 14:09:05,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:05,119 INFO L225 Difference]: With dead ends: 34 [2022-02-20 14:09:05,119 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:09:05,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:05,121 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:05,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:09:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:09:05,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:05,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,133 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,133 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:05,134 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 14:09:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:09:05,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:05,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:05,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 14:09:05,136 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 14:09:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:05,137 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 14:09:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:09:05,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:05,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:05,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:05,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-20 14:09:05,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2022-02-20 14:09:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:05,140 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-20 14:09:05,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 14:09:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:09:05,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:05,141 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:05,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:09:05,355 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:09:05,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash -150327986, now seen corresponding path program 2 times [2022-02-20 14:09:05,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:05,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346190892] [2022-02-20 14:09:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:05,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#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(36, 2); {325#true} is VALID [2022-02-20 14:09:05,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {327#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:05,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {327#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:05,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:05,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:05,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:05,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:05,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:05,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:05,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {331#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:05,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} main_~i~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {326#false} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#false} havoc main_~x~0#1;main_~x~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {326#false} is VALID [2022-02-20 14:09:05,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#false} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 14:09:05,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 14:09:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:09:05,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:05,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346190892] [2022-02-20 14:09:05,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346190892] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:05,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132085352] [2022-02-20 14:09:05,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:09:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:05,564 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:09:05,568 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:09:05,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:09:05,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:05,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:09:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:05,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:05,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#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(36, 2); {325#true} is VALID [2022-02-20 14:09:05,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {338#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:05,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {338#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:05,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {338#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:05,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:05,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:05,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:05,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:05,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:05,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {330#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {331#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:05,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} main_~i~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {326#false} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#false} havoc main_~x~0#1;main_~x~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {326#false} is VALID [2022-02-20 14:09:05,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#false} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 14:09:05,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 14:09:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:09:05,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:05,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 14:09:05,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#false} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 14:09:05,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#false} havoc main_~x~0#1;main_~x~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {326#false} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {326#false} is VALID [2022-02-20 14:09:05,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} main_~i~0#1 := 0; {326#false} is VALID [2022-02-20 14:09:05,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {426#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {326#false} is VALID [2022-02-20 14:09:05,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {426#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:05,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {430#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:05,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {430#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:05,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {437#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:05,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {437#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:05,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {444#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:05,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {444#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:05,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {451#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:05,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {451#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:05,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#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(36, 2); {325#true} is VALID [2022-02-20 14:09:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:09:05,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132085352] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:05,980 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:05,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:09:05,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379910269] [2022-02-20 14:09:05,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:09:05,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:05,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:06,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:09:06,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:09:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:06,012 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:06,232 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-02-20 14:09:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:09:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:09:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2022-02-20 14:09:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2022-02-20 14:09:06,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 66 transitions. [2022-02-20 14:09:06,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:06,300 INFO L225 Difference]: With dead ends: 55 [2022-02-20 14:09:06,300 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:09:06,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:06,303 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:06,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:09:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 14:09:06,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:06,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,323 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,323 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:06,333 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-02-20 14:09:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-20 14:09:06,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:06,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:06,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:09:06,336 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:09:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:06,340 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-02-20 14:09:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-20 14:09:06,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:06,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:06,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:06,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-02-20 14:09:06,342 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2022-02-20 14:09:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:06,342 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-02-20 14:09:06,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-02-20 14:09:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:09:06,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:06,351 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:06,378 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:09:06,570 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:09:06,571 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 887583778, now seen corresponding path program 3 times [2022-02-20 14:09:06,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:06,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306479895] [2022-02-20 14:09:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:06,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#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(36, 2); {693#true} is VALID [2022-02-20 14:09:06,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {695#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:06,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {695#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:06,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {695#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:06,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:06,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:06,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:06,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:06,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:06,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:06,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:06,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:06,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:06,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:06,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:06,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:06,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:06,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:06,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:06,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:06,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:06,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {705#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:06,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {705#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {694#false} is VALID [2022-02-20 14:09:06,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {694#false} main_~i~0#1 := 0; {694#false} is VALID [2022-02-20 14:09:06,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {694#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {694#false} assume !(main_~i~0#1 < 100000); {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {694#false} havoc main_~x~0#1;main_~x~0#1 := 0; {694#false} is VALID [2022-02-20 14:09:06,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {694#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {694#false} is VALID [2022-02-20 14:09:06,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {694#false} assume 0 == __VERIFIER_assert_~cond#1; {694#false} is VALID [2022-02-20 14:09:06,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-02-20 14:09:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 14:09:06,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:06,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306479895] [2022-02-20 14:09:06,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306479895] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:06,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016550950] [2022-02-20 14:09:06,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:09:06,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:06,865 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:09:06,866 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:09:07,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:09:07,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:07,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:09:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:07,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#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(36, 2); {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {693#true} assume !(main_~i~0#1 < 100000); {693#true} is VALID [2022-02-20 14:09:07,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {693#true} main_~i~0#1 := 0; {778#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:07,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:07,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {696#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:07,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:07,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {698#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:07,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {699#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:07,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {700#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:07,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {701#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:07,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {702#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:07,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {703#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:07,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {704#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {705#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:07,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {705#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {694#false} is VALID [2022-02-20 14:09:07,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {694#false} havoc main_~x~0#1;main_~x~0#1 := 0; {694#false} is VALID [2022-02-20 14:09:07,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {694#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {694#false} is VALID [2022-02-20 14:09:07,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {694#false} assume 0 == __VERIFIER_assert_~cond#1; {694#false} is VALID [2022-02-20 14:09:07,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-02-20 14:09:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:09:07,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:07,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-02-20 14:09:07,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {694#false} assume 0 == __VERIFIER_assert_~cond#1; {694#false} is VALID [2022-02-20 14:09:07,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {694#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {694#false} is VALID [2022-02-20 14:09:07,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {694#false} havoc main_~x~0#1;main_~x~0#1 := 0; {694#false} is VALID [2022-02-20 14:09:07,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {836#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {694#false} is VALID [2022-02-20 14:09:07,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {840#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {836#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:07,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {840#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:07,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {848#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {844#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:07,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {852#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {848#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:07,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {856#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {852#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:07,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {856#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:07,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {864#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {860#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:07,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {864#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:07,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {868#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:07,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {876#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {872#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:07,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {693#true} main_~i~0#1 := 0; {876#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:07,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {693#true} assume !(main_~i~0#1 < 100000); {693#true} is VALID [2022-02-20 14:09:07,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {693#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {693#true} is VALID [2022-02-20 14:09:07,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#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(36, 2); {693#true} is VALID [2022-02-20 14:09:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:09:07,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016550950] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:07,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:07,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:09:07,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053654568] [2022-02-20 14:09:07,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:09:07,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:07,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:07,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:07,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:09:07,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:09:07,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:07,849 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:08,175 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-02-20 14:09:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:09:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:09:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-02-20 14:09:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-02-20 14:09:08,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 114 transitions. [2022-02-20 14:09:08,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:08,272 INFO L225 Difference]: With dead ends: 97 [2022-02-20 14:09:08,272 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 14:09:08,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:08,273 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:08,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 60 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 14:09:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 14:09:08,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:08,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,315 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,316 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:08,318 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 14:09:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 14:09:08,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:08,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:08,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 14:09:08,322 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 14:09:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:08,327 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 14:09:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 14:09:08,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:08,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:08,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:08,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-20 14:09:08,331 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 39 [2022-02-20 14:09:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:08,333 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-20 14:09:08,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 14:09:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 14:09:08,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:08,336 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:08,359 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:09:08,555 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:09:08,555 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1865987530, now seen corresponding path program 4 times [2022-02-20 14:09:08,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:08,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182328173] [2022-02-20 14:09:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:09,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {1385#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(36, 2); {1385#true} is VALID [2022-02-20 14:09:09,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {1387#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:09,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1387#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1387#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:09,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {1387#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:09,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:09,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:09,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:09,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:09,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:09,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:09,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:09,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:09,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:09,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:09,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:09,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:09,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:09,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:09,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:09,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:09,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:09,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:09,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:09,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:09,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:09,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:09,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:09,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:09,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:09,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:09,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:09,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:09,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:09,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:09,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:09,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:09,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:09,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:09,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:09,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:09,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:09,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:09,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:09,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:09,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:09,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1409#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {1409#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {1386#false} main_~i~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {1386#false} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:09,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {1386#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:09,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {1386#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1386#false} is VALID [2022-02-20 14:09:09,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {1386#false} assume 0 == __VERIFIER_assert_~cond#1; {1386#false} is VALID [2022-02-20 14:09:09,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-02-20 14:09:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:09:09,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:09,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182328173] [2022-02-20 14:09:09,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182328173] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:09,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562239155] [2022-02-20 14:09:09,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:09:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:09,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:09,117 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:09:09,151 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:09:09,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:09:09,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:09,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:09:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:09,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:09,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {1385#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(36, 2); {1385#true} is VALID [2022-02-20 14:09:09,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {1416#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:09,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {1416#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1416#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:09,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {1416#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:09,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:09,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {1388#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:09,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:09,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1389#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:09,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:09,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:09,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:09,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:09,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:09,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {1392#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:09,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:09,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1393#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:09,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:09,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1394#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:09,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:09,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:09,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:09,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:09,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:09,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1397#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:09,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:09,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1398#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:09,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:09,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {1399#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:09,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:09,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {1400#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:09,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:09,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {1401#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:09,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:09,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {1402#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:09,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:09,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {1403#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:09,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:09,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {1404#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:09,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:09,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:09,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:09,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {1406#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:09,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:09,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {1407#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:09,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:09,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {1408#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1409#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {1409#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {1386#false} main_~i~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {1386#false} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {1386#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:09,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {1386#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1386#false} is VALID [2022-02-20 14:09:09,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {1386#false} assume 0 == __VERIFIER_assert_~cond#1; {1386#false} is VALID [2022-02-20 14:09:09,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-02-20 14:09:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:09:09,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:10,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-02-20 14:09:10,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {1386#false} assume 0 == __VERIFIER_assert_~cond#1; {1386#false} is VALID [2022-02-20 14:09:10,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {1386#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1386#false} is VALID [2022-02-20 14:09:10,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {1386#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:10,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {1386#false} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {1386#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {1386#false} is VALID [2022-02-20 14:09:10,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {1386#false} main_~i~0#1 := 0; {1386#false} is VALID [2022-02-20 14:09:10,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {1720#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1386#false} is VALID [2022-02-20 14:09:10,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {1724#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1720#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:10,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {1724#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1724#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:10,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {1731#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1724#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:10,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {1731#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1731#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:10,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {1738#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1731#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:10,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {1738#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1738#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:10,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {1745#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1738#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:10,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {1745#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1745#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:10,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {1752#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1745#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:10,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {1752#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1752#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:10,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {1759#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1752#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:10,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {1759#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1759#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:10,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1759#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:10,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1766#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:10,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {1773#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1766#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:10,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {1773#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1773#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:10,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {1780#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1773#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:10,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {1780#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1780#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:10,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1780#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:10,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1787#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:10,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1794#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1787#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:10,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {1794#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1794#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:09:10,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {1801#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1794#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:09:10,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {1801#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1801#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:10,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {1808#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1801#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:10,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {1808#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1808#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:09:10,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1808#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:09:10,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {1815#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1815#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:10,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {1822#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1815#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:10,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1822#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1822#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:09:10,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1822#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:09:10,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1829#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:10,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1829#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:10,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1836#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1836#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:09:10,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1843#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1836#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:09:10,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {1843#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1843#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:10,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1843#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:10,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {1850#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1850#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:09:10,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {1857#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1850#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:09:10,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {1857#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1857#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:10,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1857#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:10,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {1864#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1864#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:09:10,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {1871#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1864#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:09:10,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1871#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:10,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {1871#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:10,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {1385#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(36, 2); {1385#true} is VALID [2022-02-20 14:09:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-02-20 14:09:10,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562239155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:10,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:10,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:09:10,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661258106] [2022-02-20 14:09:10,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 14:09:10,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:10,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:10,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:10,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:09:10,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:09:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:09:10,918 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,685 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2022-02-20 14:09:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:09:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 14:09:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 210 transitions. [2022-02-20 14:09:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 210 transitions. [2022-02-20 14:09:11,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 210 transitions. [2022-02-20 14:09:11,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:11,859 INFO L225 Difference]: With dead ends: 181 [2022-02-20 14:09:11,859 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 14:09:11,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:09:11,861 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:11,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 36 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:09:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 14:09:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-02-20 14:09:11,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:11,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,945 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,946 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,950 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-02-20 14:09:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2022-02-20 14:09:11,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:11,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:11,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 150 states. [2022-02-20 14:09:11,951 INFO L87 Difference]: Start difference. First operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 150 states. [2022-02-20 14:09:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:11,955 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-02-20 14:09:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2022-02-20 14:09:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:11,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:11,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:11,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 149 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2022-02-20 14:09:11,961 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 75 [2022-02-20 14:09:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:11,962 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2022-02-20 14:09:11,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2022-02-20 14:09:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-02-20 14:09:11,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:11,963 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:11,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:09:12,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:12,188 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1455093478, now seen corresponding path program 5 times [2022-02-20 14:09:12,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:12,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014798331] [2022-02-20 14:09:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:13,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#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(36, 2); {2725#true} is VALID [2022-02-20 14:09:13,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;main_~i~0#1 := 0; {2727#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:13,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2727#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2727#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:13,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {2727#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:13,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {2728#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:13,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {2728#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2729#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:13,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {2729#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2729#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:13,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {2729#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2730#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:13,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2730#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:13,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2731#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:13,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {2731#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2731#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:13,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2731#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2732#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:13,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {2732#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2732#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:13,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {2732#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2733#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:13,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {2733#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2733#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:13,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {2733#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2734#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:13,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {2734#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2734#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:13,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {2734#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2735#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:13,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {2735#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2735#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:13,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {2735#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2736#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:13,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {2736#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2736#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:13,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {2736#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2737#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:13,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {2737#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2737#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:13,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {2737#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2738#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:13,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {2738#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2738#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:13,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {2738#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2739#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:13,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {2739#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2739#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:13,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {2739#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2740#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:13,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {2740#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2740#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:13,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {2740#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2741#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:13,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {2741#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2741#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:13,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {2741#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2742#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:13,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {2742#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2742#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:13,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {2742#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2743#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:13,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {2743#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2743#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:13,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {2743#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2744#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:13,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {2744#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2744#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:13,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {2744#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2745#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:13,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {2745#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2745#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:13,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {2745#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2746#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:13,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {2746#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2746#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:13,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {2746#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2747#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:13,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {2747#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2747#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:13,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {2747#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2748#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:13,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {2748#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2748#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:13,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {2748#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2749#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:13,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {2749#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2749#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:13,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {2749#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2750#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:09:13,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {2750#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2750#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:09:13,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {2750#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2751#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:13,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {2751#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2751#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:09:13,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {2751#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2752#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:09:13,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {2752#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2752#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:09:13,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {2752#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2753#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:13,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {2753#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2753#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:09:13,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {2753#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2754#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:09:13,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {2754#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2754#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:09:13,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {2754#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2755#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:13,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {2755#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2755#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:09:13,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {2755#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2756#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:09:13,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {2756#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2756#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:09:13,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {2756#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2757#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:13,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {2757#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2757#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:09:13,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {2757#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2758#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:09:13,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {2758#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2758#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:09:13,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {2758#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2759#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:13,452 INFO L290 TraceCheckUtils]: 66: Hoare triple {2759#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2759#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:09:13,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {2759#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2760#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:09:13,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {2760#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2760#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:09:13,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {2760#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2761#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:13,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {2761#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2761#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:09:13,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {2761#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2762#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:09:13,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {2762#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2762#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:09:13,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {2762#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2763#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:13,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {2763#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2763#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:09:13,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {2763#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2764#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:09:13,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {2764#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2764#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:09:13,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {2764#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2765#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:13,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {2765#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2765#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:09:13,457 INFO L290 TraceCheckUtils]: 79: Hoare triple {2765#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2766#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:09:13,457 INFO L290 TraceCheckUtils]: 80: Hoare triple {2766#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2766#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:09:13,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {2766#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2767#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:13,458 INFO L290 TraceCheckUtils]: 82: Hoare triple {2767#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2767#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:09:13,458 INFO L290 TraceCheckUtils]: 83: Hoare triple {2767#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2768#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:09:13,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {2768#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2768#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:09:13,459 INFO L290 TraceCheckUtils]: 85: Hoare triple {2768#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2769#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:13,459 INFO L290 TraceCheckUtils]: 86: Hoare triple {2769#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2769#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:09:13,460 INFO L290 TraceCheckUtils]: 87: Hoare triple {2769#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2770#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:09:13,460 INFO L290 TraceCheckUtils]: 88: Hoare triple {2770#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2770#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:09:13,460 INFO L290 TraceCheckUtils]: 89: Hoare triple {2770#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2771#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:13,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {2771#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2771#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:09:13,461 INFO L290 TraceCheckUtils]: 91: Hoare triple {2771#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2772#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:09:13,461 INFO L290 TraceCheckUtils]: 92: Hoare triple {2772#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2772#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {2772#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2773#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 94: Hoare triple {2773#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 95: Hoare triple {2726#false} main_~i~0#1 := 0; {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 96: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 97: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 98: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 99: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,462 INFO L290 TraceCheckUtils]: 100: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 101: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 102: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 103: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 104: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 105: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 106: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 107: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 108: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 109: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 110: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,463 INFO L290 TraceCheckUtils]: 111: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 112: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 113: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 114: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 115: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 116: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 117: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 118: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 119: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 120: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 121: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,464 INFO L290 TraceCheckUtils]: 122: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 123: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 124: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 125: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 126: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 127: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 128: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 129: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 130: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 131: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,465 INFO L290 TraceCheckUtils]: 132: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 133: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 134: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 135: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 136: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 137: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 138: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 139: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 140: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 141: Hoare triple {2726#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1 - main_#t~mem5#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~i~0#1 := 1 + main_~i~0#1; {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 142: Hoare triple {2726#false} assume !(main_~i~0#1 < 100000); {2726#false} is VALID [2022-02-20 14:09:13,466 INFO L290 TraceCheckUtils]: 143: Hoare triple {2726#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2726#false} is VALID [2022-02-20 14:09:13,467 INFO L290 TraceCheckUtils]: 144: Hoare triple {2726#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem7#1 - main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2726#false} is VALID [2022-02-20 14:09:13,467 INFO L290 TraceCheckUtils]: 145: Hoare triple {2726#false} assume 0 == __VERIFIER_assert_~cond#1; {2726#false} is VALID [2022-02-20 14:09:13,467 INFO L290 TraceCheckUtils]: 146: Hoare triple {2726#false} assume !false; {2726#false} is VALID [2022-02-20 14:09:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-02-20 14:09:13,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:13,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014798331] [2022-02-20 14:09:13,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014798331] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:13,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348733853] [2022-02-20 14:09:13,469 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:09:13,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:13,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:13,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:09:13,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process