./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy3_ground-2.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_copy3_ground-2.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 217f19c8e5e57d916627a12a8c23c5343b3d451054ddc6d3d6dc70e40dff121a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:33,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:33,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:33,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:33,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:33,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:33,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:33,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:33,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:33,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:33,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:33,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:33,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:33,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:33,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:33,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:33,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:33,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:33,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:33,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:33,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:33,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:33,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:33,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:33,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:33,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:33,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:33,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:33,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:33,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:33,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:33,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:33,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:33,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:33,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:33,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:33,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:33,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:33,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:33,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:33,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:33,423 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:02:33,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:33,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:33,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:33,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:33,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:33,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:33,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:33,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:33,463 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:33,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:33,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:33,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:33,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:33,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:33,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:33,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:33,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:33,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:33,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:33,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:33,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:33,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:33,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:33,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:33,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:33,468 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:33,468 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:33,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:33,469 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 -> 217f19c8e5e57d916627a12a8c23c5343b3d451054ddc6d3d6dc70e40dff121a [2022-02-20 14:02:33,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:33,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:33,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:33,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:33,784 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:33,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy3_ground-2.i [2022-02-20 14:02:33,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07ea4dcc/883443471e574c3b9bf85a09c719ce1f/FLAG71781a955 [2022-02-20 14:02:34,403 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:34,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy3_ground-2.i [2022-02-20 14:02:34,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07ea4dcc/883443471e574c3b9bf85a09c719ce1f/FLAG71781a955 [2022-02-20 14:02:34,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07ea4dcc/883443471e574c3b9bf85a09c719ce1f [2022-02-20 14:02:34,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:34,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:34,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:34,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:34,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:34,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:34" (1/1) ... [2022-02-20 14:02:34,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2176ef36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:34, skipping insertion in model container [2022-02-20 14:02:34,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:34" (1/1) ... [2022-02-20 14:02:34,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:35,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:35,372 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_copy3_ground-2.i[816,829] [2022-02-20 14:02:35,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:35,397 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:35,408 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_copy3_ground-2.i[816,829] [2022-02-20 14:02:35,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:35,431 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:35,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35 WrapperNode [2022-02-20 14:02:35,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:35,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:35,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:35,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:35,595 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:02:35" (1/1) ... [2022-02-20 14:02:35,615 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:02:35" (1/1) ... [2022-02-20 14:02:35,637 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2022-02-20 14:02:35,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:35,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:35,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:35,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:35,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:35,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:35,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:35,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:35,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:36,398 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:02:36,400 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:02:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:36,988 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:36,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:37,175 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:37,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:37,180 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:02:37,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:37 BoogieIcfgContainer [2022-02-20 14:02:37,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:37,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:37,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:37,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:37,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:34" (1/3) ... [2022-02-20 14:02:37,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457f59c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:37, skipping insertion in model container [2022-02-20 14:02:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (2/3) ... [2022-02-20 14:02:37,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457f59c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:37, skipping insertion in model container [2022-02-20 14:02:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:37" (3/3) ... [2022-02-20 14:02:37,726 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy3_ground-2.i [2022-02-20 14:02:37,744 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:37,744 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:37,840 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:37,847 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:02:37,847 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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:02:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:02:37,881 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:37,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:37,883 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2053894623, now seen corresponding path program 1 times [2022-02-20 14:02:37,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:37,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78406332] [2022-02-20 14:02:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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(26, 2); {27#true} is VALID [2022-02-20 14:02:38,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {29#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {28#false} is VALID [2022-02-20 14:02:38,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} havoc main_~i~0#1;main_~i~0#1 := 0; {28#false} is VALID [2022-02-20 14:02:38,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(main_~i~0#1 < 100000); {28#false} is VALID [2022-02-20 14:02:38,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} main_~i~0#1 := 0; {28#false} is VALID [2022-02-20 14:02:38,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} assume !(main_~i~0#1 < 100000); {28#false} is VALID [2022-02-20 14:02:38,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} main_~i~0#1 := 0; {28#false} is VALID [2022-02-20 14:02:38,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !(main_~i~0#1 < 100000); {28#false} is VALID [2022-02-20 14:02:38,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} havoc main_~x~0#1;main_~x~0#1 := 0; {28#false} is VALID [2022-02-20 14:02:38,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {28#false} is VALID [2022-02-20 14:02:38,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == __VERIFIER_assert_~cond#1; {28#false} is VALID [2022-02-20 14:02:38,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 14:02:38,150 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:02:38,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:38,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78406332] [2022-02-20 14:02:38,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78406332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:38,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:38,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:38,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158881002] [2022-02-20 14:02:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:02:38,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:38,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:38,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:38,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:38,227 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,312 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 14:02:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:02:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 14:02:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 14:02:38,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-02-20 14:02:38,388 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:02:38,395 INFO L225 Difference]: With dead ends: 46 [2022-02-20 14:02:38,396 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:02:38,406 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:02:38,409 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:38,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:02:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-02-20 14:02:38,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:38,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:02:38,452 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:02:38,452 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:02:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,454 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 14:02:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:02:38,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 22 states. [2022-02-20 14:02:38,455 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 22 states. [2022-02-20 14:02:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,461 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 14:02:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:02:38,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:38,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:02:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 14:02:38,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-02-20 14:02:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:38,468 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 14:02:38,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 14:02:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:02:38,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:38,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:38,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:02:38,471 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -418223009, now seen corresponding path program 1 times [2022-02-20 14:02:38,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:38,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051045507] [2022-02-20 14:02:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:38,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#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(26, 2); {161#true} is VALID [2022-02-20 14:02:38,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {163#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {163#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {164#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:38,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {164#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#false} havoc main_~i~0#1;main_~i~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#false} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#false} main_~i~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#false} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#false} main_~i~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#false} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} havoc main_~x~0#1;main_~x~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {162#false} is VALID [2022-02-20 14:02:38,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#false} assume 0 == __VERIFIER_assert_~cond#1; {162#false} is VALID [2022-02-20 14:02:38,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-02-20 14:02:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:02:38,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:38,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051045507] [2022-02-20 14:02:38,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051045507] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:38,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256681582] [2022-02-20 14:02:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:38,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:38,576 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:02:38,578 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:02:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:02:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:38,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#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(26, 2); {161#true} is VALID [2022-02-20 14:02:38,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {161#true} is VALID [2022-02-20 14:02:38,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {161#true} is VALID [2022-02-20 14:02:38,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {161#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {161#true} is VALID [2022-02-20 14:02:38,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {161#true} assume !(main_~a~0#1 < 100000); {161#true} is VALID [2022-02-20 14:02:38,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc main_~i~0#1;main_~i~0#1 := 0; {183#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:38,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#false} main_~i~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#false} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#false} main_~i~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#false} assume !(main_~i~0#1 < 100000); {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} havoc main_~x~0#1;main_~x~0#1 := 0; {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {162#false} is VALID [2022-02-20 14:02:38,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#false} assume 0 == __VERIFIER_assert_~cond#1; {162#false} is VALID [2022-02-20 14:02:38,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-02-20 14:02:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:02:38,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:02:38,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256681582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:38,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:02:38,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:02:38,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555478880] [2022-02-20 14:02:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:02:38,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:38,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:38,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:38,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:38,729 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,779 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-02-20 14:02:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:38,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:02:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-20 14:02:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-20 14:02:38,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-02-20 14:02:38,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,823 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:02:38,823 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:02:38,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:38,825 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:38,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:02:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-02-20 14:02:38,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:38,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:02:38,834 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:02:38,834 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:02:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,836 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:02:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:02:38,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 27 states. [2022-02-20 14:02:38,837 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 27 states. [2022-02-20 14:02:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,848 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:02:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:02:38,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:38,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:02:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:02:38,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-02-20 14:02:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:38,851 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:02:38,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:02:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:02:38,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:38,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:38,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:39,078 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:02:39,079 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash 241580185, now seen corresponding path program 1 times [2022-02-20 14:02:39,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:39,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192694521] [2022-02-20 14:02:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#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(26, 2); {349#true} is VALID [2022-02-20 14:02:39,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {351#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {351#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {351#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {352#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:39,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {352#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#false} havoc main_~i~0#1;main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {350#false} is VALID [2022-02-20 14:02:39,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {350#false} is VALID [2022-02-20 14:02:39,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {350#false} is VALID [2022-02-20 14:02:39,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#false} havoc main_~x~0#1;main_~x~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {350#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {350#false} is VALID [2022-02-20 14:02:39,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {350#false} assume 0 == __VERIFIER_assert_~cond#1; {350#false} is VALID [2022-02-20 14:02:39,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-02-20 14:02:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:02:39,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:39,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192694521] [2022-02-20 14:02:39,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192694521] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:39,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930389271] [2022-02-20 14:02:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:39,216 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:02:39,236 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:02:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:39,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#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(26, 2); {349#true} is VALID [2022-02-20 14:02:39,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {359#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {359#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {359#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {352#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {352#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#false} havoc main_~i~0#1;main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {350#false} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {350#false} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {350#false} is VALID [2022-02-20 14:02:39,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {350#false} is VALID [2022-02-20 14:02:39,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {350#false} is VALID [2022-02-20 14:02:39,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {350#false} is VALID [2022-02-20 14:02:39,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#false} havoc main_~x~0#1;main_~x~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {350#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {350#false} is VALID [2022-02-20 14:02:39,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {350#false} assume 0 == __VERIFIER_assert_~cond#1; {350#false} is VALID [2022-02-20 14:02:39,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-02-20 14:02:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:02:39,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:39,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-02-20 14:02:39,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {350#false} assume 0 == __VERIFIER_assert_~cond#1; {350#false} is VALID [2022-02-20 14:02:39,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {350#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#false} havoc main_~x~0#1;main_~x~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {350#false} is VALID [2022-02-20 14:02:39,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {350#false} is VALID [2022-02-20 14:02:39,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#false} main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:39,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#false} assume !(main_~i~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:39,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {350#false} is VALID [2022-02-20 14:02:39,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {350#false} is VALID [2022-02-20 14:02:40,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#false} havoc main_~i~0#1;main_~i~0#1 := 0; {350#false} is VALID [2022-02-20 14:02:40,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {350#false} is VALID [2022-02-20 14:02:40,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {465#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:40,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {469#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:40,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {469#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:40,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#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(26, 2); {349#true} is VALID [2022-02-20 14:02:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:02:40,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930389271] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:40,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:40,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:40,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182817735] [2022-02-20 14:02:40,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:40,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:40,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:40,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:40,360 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:40,511 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-02-20 14:02:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 14:02:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 14:02:40,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 14:02:40,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:40,569 INFO L225 Difference]: With dead ends: 49 [2022-02-20 14:02:40,569 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 14:02:40,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:02:40,571 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:40,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 14:02:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 14:02:40,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:40,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:02:40,579 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:02:40,660 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:02:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:40,661 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 14:02:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 14:02:40,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:40,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:40,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 30 states. [2022-02-20 14:02:40,661 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 30 states. [2022-02-20 14:02:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:40,662 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 14:02:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 14:02:40,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:40,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:40,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:40,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:02:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 14:02:40,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2022-02-20 14:02:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:40,665 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 14:02:40,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:02:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 14:02:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:02:41,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:41,329 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:41,351 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:02:41,530 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:02:41,530 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:41,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash 886739667, now seen corresponding path program 2 times [2022-02-20 14:02:41,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:41,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748640187] [2022-02-20 14:02:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:41,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#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(26, 2); {648#true} is VALID [2022-02-20 14:02:41,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {648#true} is VALID [2022-02-20 14:02:41,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {648#true} is VALID [2022-02-20 14:02:41,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {648#true} is VALID [2022-02-20 14:02:41,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {648#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {648#true} is VALID [2022-02-20 14:02:41,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {648#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {648#true} is VALID [2022-02-20 14:02:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {648#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {648#true} is VALID [2022-02-20 14:02:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {648#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {648#true} is VALID [2022-02-20 14:02:41,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {648#true} is VALID [2022-02-20 14:02:41,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {648#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {648#true} is VALID [2022-02-20 14:02:41,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(main_~a~0#1 < 100000); {648#true} is VALID [2022-02-20 14:02:41,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {648#true} havoc main_~i~0#1;main_~i~0#1 := 0; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {651#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:41,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {651#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:41,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {649#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {649#false} is VALID [2022-02-20 14:02:42,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {649#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {649#false} is VALID [2022-02-20 14:02:42,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:42,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {649#false} havoc main_~x~0#1;main_~x~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:42,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {649#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {649#false} is VALID [2022-02-20 14:02:42,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#false} assume 0 == __VERIFIER_assert_~cond#1; {649#false} is VALID [2022-02-20 14:02:42,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-02-20 14:02:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 14:02:42,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:42,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748640187] [2022-02-20 14:02:42,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748640187] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:42,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495725819] [2022-02-20 14:02:42,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:02:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:42,336 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:02:42,337 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:02:42,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:02:43,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:43,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:02:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:43,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:44,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#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(26, 2); {648#true} is VALID [2022-02-20 14:02:44,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {658#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {658#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {665#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {665#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {665#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {665#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {672#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {672#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {672#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {679#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {679#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {686#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:44,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#false} havoc main_~i~0#1;main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {649#false} is VALID [2022-02-20 14:02:44,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {649#false} is VALID [2022-02-20 14:02:44,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {649#false} is VALID [2022-02-20 14:02:44,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {649#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {649#false} is VALID [2022-02-20 14:02:44,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {649#false} is VALID [2022-02-20 14:02:44,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {649#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {649#false} is VALID [2022-02-20 14:02:44,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {649#false} havoc main_~x~0#1;main_~x~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {649#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {649#false} is VALID [2022-02-20 14:02:44,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#false} assume 0 == __VERIFIER_assert_~cond#1; {649#false} is VALID [2022-02-20 14:02:44,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-02-20 14:02:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:02:44,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:44,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-02-20 14:02:44,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#false} assume 0 == __VERIFIER_assert_~cond#1; {649#false} is VALID [2022-02-20 14:02:44,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {649#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {649#false} is VALID [2022-02-20 14:02:44,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {649#false} havoc main_~x~0#1;main_~x~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {649#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {649#false} is VALID [2022-02-20 14:02:44,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {649#false} is VALID [2022-02-20 14:02:44,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {649#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {649#false} is VALID [2022-02-20 14:02:44,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {649#false} is VALID [2022-02-20 14:02:44,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} assume !(main_~i~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {649#false} is VALID [2022-02-20 14:02:44,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {649#false} is VALID [2022-02-20 14:02:44,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#false} havoc main_~i~0#1;main_~i~0#1 := 0; {649#false} is VALID [2022-02-20 14:02:44,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {649#false} is VALID [2022-02-20 14:02:44,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {786#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:44,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {790#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:44,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {797#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {790#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:44,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {797#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {797#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:44,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {797#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:44,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {804#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {804#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:44,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {811#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {804#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:44,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {811#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:44,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {811#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:44,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#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(26, 2); {648#true} is VALID [2022-02-20 14:02:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:02:44,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495725819] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:44,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:44,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:02:44,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228224603] [2022-02-20 14:02:44,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:02:44,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:44,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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:02:44,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:44,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:02:44,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:02:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:44,370 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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:02:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,590 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-02-20 14:02:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:02:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:02:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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:02:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 83 transitions. [2022-02-20 14:02:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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:02:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 83 transitions. [2022-02-20 14:02:44,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 83 transitions. [2022-02-20 14:02:44,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:44,663 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:02:44,663 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:02:44,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:44,664 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:44,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:02:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-02-20 14:02:44,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:44,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:02:44,690 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:02:44,691 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:02:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,692 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-02-20 14:02:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 14:02:44,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:44,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:44,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 51 states. [2022-02-20 14:02:44,694 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 51 states. [2022-02-20 14:02:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,695 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-02-20 14:02:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 14:02:44,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:44,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:44,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:44,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:02:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-02-20 14:02:44,698 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2022-02-20 14:02:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:44,698 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-02-20 14:02:44,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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:02:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 14:02:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:02:44,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:44,700 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:44,727 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:02:44,900 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:02:44,901 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1464945409, now seen corresponding path program 3 times [2022-02-20 14:02:44,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:44,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197421952] [2022-02-20 14:02:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1089#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(26, 2); {1089#true} is VALID [2022-02-20 14:02:45,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1091#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1091#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {1091#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1092#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:45,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {1092#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1092#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:45,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1093#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:45,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1093#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:45,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1094#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:45,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {1094#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1094#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:45,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1094#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1095#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:45,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {1095#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1095#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:45,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1095#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:45,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:45,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:45,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:45,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:45,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:45,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1099#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:45,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {1099#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1099#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:45,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1100#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:45,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1100#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:45,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1101#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:45,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {1101#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {1090#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1090#false} is VALID [2022-02-20 14:02:45,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {1090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1090#false} is VALID [2022-02-20 14:02:45,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1090#false} is VALID [2022-02-20 14:02:45,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {1090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1090#false} is VALID [2022-02-20 14:02:45,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {1090#false} assume !(main_~i~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {1090#false} main_~i~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {1090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {1090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1090#false} is VALID [2022-02-20 14:02:45,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {1090#false} assume !(main_~i~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {1090#false} main_~i~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1090#false} is VALID [2022-02-20 14:02:45,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {1090#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1090#false} is VALID [2022-02-20 14:02:45,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {1090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1090#false} is VALID [2022-02-20 14:02:45,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {1090#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {1090#false} assume !(main_~i~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {1090#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {1090#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {1090#false} assume 0 == __VERIFIER_assert_~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2022-02-20 14:02:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:02:45,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:45,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197421952] [2022-02-20 14:02:45,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197421952] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:45,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172085546] [2022-02-20 14:02:45,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:02:45,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:45,148 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:02:45,150 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:02:45,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:02:45,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:02:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:45,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {1089#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(26, 2); {1089#true} is VALID [2022-02-20 14:02:45,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#true} assume !(main_~a~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1089#true} is VALID [2022-02-20 14:02:45,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {1089#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {1089#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {1089#true} assume !(main_~i~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {1089#true} main_~i~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1089#true} is VALID [2022-02-20 14:02:45,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {1089#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1089#true} is VALID [2022-02-20 14:02:45,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1089#true} is VALID [2022-02-20 14:02:45,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {1089#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1089#true} is VALID [2022-02-20 14:02:45,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {1089#true} assume !(main_~i~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {1089#true} main_~i~0#1 := 0; {1210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:45,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {1210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:45,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {1210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1217#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:45,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {1217#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1217#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:45,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {1217#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1224#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:45,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {1224#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {1090#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {1090#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {1090#false} assume 0 == __VERIFIER_assert_~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2022-02-20 14:02:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-02-20 14:02:45,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:45,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2022-02-20 14:02:45,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {1090#false} assume 0 == __VERIFIER_assert_~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {1090#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1090#false} is VALID [2022-02-20 14:02:45,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {1090#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1090#false} is VALID [2022-02-20 14:02:45,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {1252#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1090#false} is VALID [2022-02-20 14:02:45,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {1256#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1252#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:45,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {1256#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1256#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:45,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {1263#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1256#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:45,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {1263#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1263#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:45,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {1089#true} main_~i~0#1 := 0; {1263#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:45,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {1089#true} assume !(main_~i~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {1089#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1089#true} is VALID [2022-02-20 14:02:45,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1089#true} is VALID [2022-02-20 14:02:45,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {1089#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1089#true} is VALID [2022-02-20 14:02:45,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1089#true} is VALID [2022-02-20 14:02:45,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {1089#true} main_~i~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {1089#true} assume !(main_~i~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {1089#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {1089#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1089#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1089#true} is VALID [2022-02-20 14:02:45,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#true} assume !(main_~a~0#1 < 100000); {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {1089#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1089#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1089#true} is VALID [2022-02-20 14:02:45,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1089#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(26, 2); {1089#true} is VALID [2022-02-20 14:02:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-02-20 14:02:45,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172085546] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:45,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:45,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:02:45,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765592899] [2022-02-20 14:02:45,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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 45 [2022-02-20 14:02:45,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:45,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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:02:45,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:45,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:02:45,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:45,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:02:45,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:45,625 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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:02:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,931 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-02-20 14:02:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:02:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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 45 [2022-02-20 14:02:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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:02:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2022-02-20 14:02:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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:02:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2022-02-20 14:02:45,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2022-02-20 14:02:46,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:46,046 INFO L225 Difference]: With dead ends: 100 [2022-02-20 14:02:46,046 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:02:46,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:46,048 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:46,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 90 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:02:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-02-20 14:02:46,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:46,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:02:46,074 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:02:46,074 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:02:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:46,077 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-20 14:02:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-20 14:02:46,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:46,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:46,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 75 states. [2022-02-20 14:02:46,078 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 75 states. [2022-02-20 14:02:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:46,080 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-20 14:02:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-20 14:02:46,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:46,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:46,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:46,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:02:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-02-20 14:02:46,084 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2022-02-20 14:02:46,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:46,084 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-02-20 14:02:46,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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:02:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-02-20 14:02:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 14:02:46,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:46,086 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:46,119 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:02:46,299 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:02:46,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1964985639, now seen corresponding path program 4 times [2022-02-20 14:02:46,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:46,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561773850] [2022-02-20 14:02:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:46,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#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(26, 2); {1776#true} is VALID [2022-02-20 14:02:46,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1778#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:46,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1778#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:46,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {1778#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1779#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:46,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1779#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:46,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1780#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:46,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {1780#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1780#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:46,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1781#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:46,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1781#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1781#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:46,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {1781#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1782#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:46,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {1782#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1782#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:46,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {1782#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1783#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:46,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1783#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:46,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1784#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:46,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {1784#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1784#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:46,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {1784#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1785#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:46,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {1785#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1785#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:46,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {1785#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1786#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:46,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {1786#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1786#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:46,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {1786#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1787#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:46,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1787#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:46,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {1787#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1788#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:46,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {1788#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1788#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:46,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {1788#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1789#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:46,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_~a~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:46,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1777#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1777#false} is VALID [2022-02-20 14:02:46,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {1777#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {1777#false} assume !(main_~i~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {1777#false} main_~i~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {1777#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {1777#false} assume !(main_~i~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {1777#false} main_~i~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {1777#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {1777#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {1777#false} assume !(main_~i~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {1777#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:46,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {1777#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1777#false} is VALID [2022-02-20 14:02:46,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {1777#false} assume 0 == __VERIFIER_assert_~cond#1; {1777#false} is VALID [2022-02-20 14:02:46,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {1777#false} assume !false; {1777#false} is VALID [2022-02-20 14:02:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-02-20 14:02:46,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:46,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561773850] [2022-02-20 14:02:46,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561773850] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:46,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277940419] [2022-02-20 14:02:46,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:02:46,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:46,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:46,555 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:02:46,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:02:46,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:02:46,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:02:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:46,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:47,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#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(26, 2); {1776#true} is VALID [2022-02-20 14:02:47,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {1776#true} assume !(main_~a~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {1776#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {1776#true} assume !(main_~i~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {1776#true} main_~i~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {1776#true} assume !(main_~i~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {1776#true} main_~i~0#1 := 0; {1952#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:47,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {1952#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1952#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:47,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {1952#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1959#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:47,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {1959#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1959#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:47,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {1959#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1966#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {1966#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1966#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {1966#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1973#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {1973#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1973#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {1973#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1980#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {1980#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1980#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:47,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {1980#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1987#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:47,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1987#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:47,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1994#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:02:47,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {1994#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:47,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {1777#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:47,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {1777#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1777#false} is VALID [2022-02-20 14:02:47,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {1777#false} assume 0 == __VERIFIER_assert_~cond#1; {1777#false} is VALID [2022-02-20 14:02:47,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {1777#false} assume !false; {1777#false} is VALID [2022-02-20 14:02:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-02-20 14:02:47,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:47,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {1777#false} assume !false; {1777#false} is VALID [2022-02-20 14:02:47,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {1777#false} assume 0 == __VERIFIER_assert_~cond#1; {1777#false} is VALID [2022-02-20 14:02:47,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {1777#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1777#false} is VALID [2022-02-20 14:02:47,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {1777#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1777#false} is VALID [2022-02-20 14:02:47,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {2022#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1777#false} is VALID [2022-02-20 14:02:47,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {2026#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2022#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:47,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {2026#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2026#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:47,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {2033#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2026#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:47,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {2033#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2033#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:47,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {2040#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2033#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:47,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {2040#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2040#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:47,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {2047#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2040#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:47,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {2047#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2047#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:47,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {2054#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2047#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:47,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {2054#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2054#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:47,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {2061#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2054#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:47,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {2061#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2061#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:02:47,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {1776#true} main_~i~0#1 := 0; {2061#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:02:47,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {1776#true} assume !(main_~i~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {1776#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {1776#true} main_~i~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {1776#true} assume !(main_~i~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {1776#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {1776#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {1776#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {1776#true} assume !(main_~a~0#1 < 100000); {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {1776#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {1776#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1776#true} is VALID [2022-02-20 14:02:47,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#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(26, 2); {1776#true} is VALID [2022-02-20 14:02:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-02-20 14:02:47,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277940419] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:47,778 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:47,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-02-20 14:02:47,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588291487] [2022-02-20 14:02:47,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:47,779 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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 71 [2022-02-20 14:02:47,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:47,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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:02:47,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:47,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-20 14:02:47,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-20 14:02:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:02:47,853 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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:02:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:48,329 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-02-20 14:02:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 14:02:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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 71 [2022-02-20 14:02:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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:02:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 173 transitions. [2022-02-20 14:02:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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:02:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 173 transitions. [2022-02-20 14:02:48,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 173 transitions. [2022-02-20 14:02:48,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:48,479 INFO L225 Difference]: With dead ends: 174 [2022-02-20 14:02:48,479 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 14:02:48,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:02:48,481 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:48,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:02:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 14:02:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-02-20 14:02:48,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:48,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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:02:48,580 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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:02:48,582 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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:02:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:48,586 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-02-20 14:02:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-02-20 14:02:48,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:48,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:48,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 125 states. [2022-02-20 14:02:48,587 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 125 states. [2022-02-20 14:02:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:48,591 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-02-20 14:02:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-02-20 14:02:48,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:48,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:48,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:48,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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:02:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-02-20 14:02:48,595 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 71 [2022-02-20 14:02:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:48,596 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-02-20 14:02:48,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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:02:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-02-20 14:02:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-20 14:02:48,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:48,597 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:48,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:48,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:48,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1940480587, now seen corresponding path program 5 times [2022-02-20 14:02:48,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:48,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718740451] [2022-02-20 14:02:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {2914#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(26, 2); {2914#true} is VALID [2022-02-20 14:02:49,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {2914#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~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2916#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2916#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2916#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {2916#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2917#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:49,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {2917#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2917#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:49,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2917#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2918#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:49,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2918#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2918#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:49,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2918#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2919#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:49,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2919#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2919#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:49,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2919#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2920#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:49,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {2920#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2920#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:49,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {2920#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2921#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:49,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2921#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2921#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:49,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {2921#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2922#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:49,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {2922#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2922#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:49,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {2922#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2923#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:49,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {2923#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2923#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:49,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {2923#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2924#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:49,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {2924#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2924#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:49,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {2924#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2925#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:49,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2925#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:49,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {2925#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2926#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:49,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {2926#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2926#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:49,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {2926#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2927#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:49,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {2927#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2927#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:49,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2927#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2928#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:49,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {2928#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_~a~0#1 < 100000); {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {2915#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {2915#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {2915#false} assume !(main_~i~0#1 < 100000); {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {2915#false} main_~i~0#1 := 0; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 75: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 78: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 79: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,198 INFO L290 TraceCheckUtils]: 80: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 81: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 82: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 83: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 84: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 85: Hoare triple {2915#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 86: Hoare triple {2915#false} assume !(main_~i~0#1 < 100000); {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 87: Hoare triple {2915#false} main_~i~0#1 := 0; {2915#false} is VALID [2022-02-20 14:02:49,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 89: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 90: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 91: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 94: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 95: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 96: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 97: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 98: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 99: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,200 INFO L290 TraceCheckUtils]: 100: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 101: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 104: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 105: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 106: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 107: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 108: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 109: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 110: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 111: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,201 INFO L290 TraceCheckUtils]: 112: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 113: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 114: Hoare triple {2915#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 115: Hoare triple {2915#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 116: Hoare triple {2915#false} assume !(main_~i~0#1 < 100000); {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 117: Hoare triple {2915#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 118: Hoare triple {2915#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem12#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2915#false} is VALID [2022-02-20 14:02:49,202 INFO L290 TraceCheckUtils]: 119: Hoare triple {2915#false} assume 0 == __VERIFIER_assert_~cond#1; {2915#false} is VALID [2022-02-20 14:02:49,203 INFO L290 TraceCheckUtils]: 120: Hoare triple {2915#false} assume !false; {2915#false} is VALID [2022-02-20 14:02:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2022-02-20 14:02:49,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718740451] [2022-02-20 14:02:49,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718740451] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:49,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200612536] [2022-02-20 14:02:49,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:02:49,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:49,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:49,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:02:49,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process