./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy4_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_copy4_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 4a66002bd28db929747d199b9986ccd34ccce90ecf5386b8e2342838dba13a02 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:44,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:44,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:44,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:44,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:44,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:44,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:44,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:44,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:44,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:44,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:44,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:44,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:44,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:44,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:44,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:44,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:44,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:44,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:44,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:44,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:44,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:44,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:44,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:44,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:44,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:44,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:44,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:44,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:44,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:44,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:44,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:44,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:44,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:44,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:44,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:44,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:44,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:44,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:44,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:44,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:44,692 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:44,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:44,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:44,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:44,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:44,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:44,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:44,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:44,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:44,726 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:44,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:44,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:44,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:44,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:44,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:44,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:44,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:44,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:44,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:44,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:44,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:44,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:44,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:44,730 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 -> 4a66002bd28db929747d199b9986ccd34ccce90ecf5386b8e2342838dba13a02 [2022-02-20 14:02:44,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:44,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:44,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:44,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:44,971 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:44,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy4_ground-2.i [2022-02-20 14:02:45,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049b63b08/3208ae0ce6eb423aa13c1499986d400b/FLAGa3782d86d [2022-02-20 14:02:45,354 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:45,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy4_ground-2.i [2022-02-20 14:02:45,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049b63b08/3208ae0ce6eb423aa13c1499986d400b/FLAGa3782d86d [2022-02-20 14:02:45,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049b63b08/3208ae0ce6eb423aa13c1499986d400b [2022-02-20 14:02:45,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:45,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:45,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:45,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:45,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:45,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:45" (1/1) ... [2022-02-20 14:02:45,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b071409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:45, skipping insertion in model container [2022-02-20 14:02:45,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:45" (1/1) ... [2022-02-20 14:02:45,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:45,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:45,509 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_copy4_ground-2.i[816,829] [2022-02-20 14:02:45,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:45,534 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:45,558 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_copy4_ground-2.i[816,829] [2022-02-20 14:02:45,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:45,600 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:45,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:45 WrapperNode [2022-02-20 14:02:45,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:45,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:45,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:45,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:45,626 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:45" (1/1) ... [2022-02-20 14:02:45,642 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:45" (1/1) ... [2022-02-20 14:02:45,703 INFO L137 Inliner]: procedures = 16, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2022-02-20 14:02:45,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:45,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:45,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:45,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:45,730 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:45" (1/1) ... [2022-02-20 14:02:45,730 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:45" (1/1) ... [2022-02-20 14:02:45,735 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:45" (1/1) ... [2022-02-20 14:02:45,736 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:45" (1/1) ... [2022-02-20 14:02:45,749 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:45" (1/1) ... [2022-02-20 14:02:45,763 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:45" (1/1) ... [2022-02-20 14:02:45,764 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:45" (1/1) ... [2022-02-20 14:02:45,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:45,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:45,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:45,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:45,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:45" (1/1) ... [2022-02-20 14:02:45,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:45,824 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:45,827 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:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:47,324 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:47,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:47,991 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:48,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:48,007 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 14:02:48,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:48 BoogieIcfgContainer [2022-02-20 14:02:48,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:48,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:48,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:48,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:48,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:45" (1/3) ... [2022-02-20 14:02:48,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d0ac08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:48, skipping insertion in model container [2022-02-20 14:02:48,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:45" (2/3) ... [2022-02-20 14:02:48,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d0ac08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:48, skipping insertion in model container [2022-02-20 14:02:48,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:48" (3/3) ... [2022-02-20 14:02:48,183 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-2.i [2022-02-20 14:02:48,187 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:48,187 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:48,891 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:48,901 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:48,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:02:48,974 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:48,975 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:48,976 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:48,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1890477095, now seen corresponding path program 1 times [2022-02-20 14:02:49,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:49,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218316551] [2022-02-20 14:02:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {30#true} is VALID [2022-02-20 14:02:49,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {32#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:49,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} havoc main_~i~0#1;main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:49,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:49,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:49,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:49,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:49,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:49,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:49,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:49,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} havoc main_~x~0#1;main_~x~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:49,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {31#false} is VALID [2022-02-20 14:02:49,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == __VERIFIER_assert_~cond#1; {31#false} is VALID [2022-02-20 14:02:49,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 14:02:49,428 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:49,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218316551] [2022-02-20 14:02:49,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218316551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:49,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:49,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:49,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35468763] [2022-02-20 14:02:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:49,454 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:49,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:49,458 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:49,489 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:49,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:49,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:49,526 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,640 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2022-02-20 14:02:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:49,640 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:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:49,642 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:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-20 14:02:49,655 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:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-20 14:02:49,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-02-20 14:02:49,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:49,767 INFO L225 Difference]: With dead ends: 52 [2022-02-20 14:02:49,768 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:02:49,770 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:49,775 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 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:49,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 58 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:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:02:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 14:02:49,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:49,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,804 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,804 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,806 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:02:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:02:49,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 14:02:49,807 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 14:02:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,808 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:02:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:02:49,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:49,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 14:02:49,811 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-02-20 14:02:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:49,812 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 14:02:49,812 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:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:02:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:02:49,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:49,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:49,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:02:49,813 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1812867813, now seen corresponding path program 1 times [2022-02-20 14:02:49,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:49,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207722448] [2022-02-20 14:02:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#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); {182#true} is VALID [2022-02-20 14:02:49,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {184#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {184#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(= |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; {185#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:49,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {185#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:49,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#false} havoc main_~i~0#1;main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:49,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:49,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:49,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} havoc main_~x~0#1;main_~x~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:49,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {183#false} is VALID [2022-02-20 14:02:49,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {183#false} assume 0 == __VERIFIER_assert_~cond#1; {183#false} is VALID [2022-02-20 14:02:49,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 14:02:49,871 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:49,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207722448] [2022-02-20 14:02:49,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207722448] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:49,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712926531] [2022-02-20 14:02:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:49,874 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:49,877 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:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:02:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:50,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#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); {182#true} is VALID [2022-02-20 14:02:50,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {182#true} is VALID [2022-02-20 14:02:50,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {182#true} is VALID [2022-02-20 14:02:50,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {182#true} is VALID [2022-02-20 14:02:50,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} assume !(main_~a~0#1 < 100000); {182#true} is VALID [2022-02-20 14:02:50,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} havoc main_~i~0#1;main_~i~0#1 := 0; {204#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:50,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {204#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:50,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:50,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:50,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:50,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:50,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:50,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:50,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} havoc main_~x~0#1;main_~x~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:50,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {183#false} is VALID [2022-02-20 14:02:50,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {183#false} assume 0 == __VERIFIER_assert_~cond#1; {183#false} is VALID [2022-02-20 14:02:50,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 14:02:50,018 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:50,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:02:50,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712926531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:50,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:02:50,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:02:50,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591533115] [2022-02-20 14:02:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:02:50,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:50,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:50,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:50,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:50,036 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,099 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-02-20 14:02:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:50,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:02:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:02:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:02:50,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-02-20 14:02:50,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:50,175 INFO L225 Difference]: With dead ends: 48 [2022-02-20 14:02:50,175 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:02:50,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:50,193 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:50,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:02:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 14:02:50,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:50,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,200 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,200 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,201 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 14:02:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 14:02:50,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:50,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:50,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 14:02:50,203 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 14:02:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,204 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 14:02:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 14:02:50,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:50,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:50,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:50,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 14:02:50,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2022-02-20 14:02:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:50,216 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 14:02:50,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 14:02:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:02:50,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:50,217 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, 1, 1, 1, 1] [2022-02-20 14:02:50,238 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:50,434 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:50,435 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2029995939, now seen corresponding path program 1 times [2022-02-20 14:02:50,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:50,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087165561] [2022-02-20 14:02:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#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); {403#true} is VALID [2022-02-20 14:02:50,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {405#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#(= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {405#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#(= |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; {406#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:50,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {406#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#false} havoc main_~i~0#1;main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#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; {404#false} is VALID [2022-02-20 14:02:50,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {404#false} is VALID [2022-02-20 14:02:50,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {404#false} is VALID [2022-02-20 14:02:50,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {404#false} is VALID [2022-02-20 14:02:50,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {404#false} is VALID [2022-02-20 14:02:50,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {404#false} is VALID [2022-02-20 14:02:50,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {404#false} is VALID [2022-02-20 14:02:50,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {404#false} is VALID [2022-02-20 14:02:50,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {404#false} havoc main_~x~0#1;main_~x~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {404#false} is VALID [2022-02-20 14:02:50,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:50,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:02:50,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:50,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087165561] [2022-02-20 14:02:50,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087165561] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:50,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061007857] [2022-02-20 14:02:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:50,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:50,526 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:50,561 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:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:50,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#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); {403#true} is VALID [2022-02-20 14:02:50,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {413#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {413#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {413#(<= |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; {406#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {406#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#false} havoc main_~i~0#1;main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#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; {404#false} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {404#false} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {404#false} is VALID [2022-02-20 14:02:50,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {404#false} is VALID [2022-02-20 14:02:50,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {404#false} havoc main_~x~0#1;main_~x~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:02:50,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:50,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:50,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:50,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {404#false} is VALID [2022-02-20 14:02:50,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {404#false} havoc main_~x~0#1;main_~x~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {404#false} is VALID [2022-02-20 14:02:50,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {404#false} is VALID [2022-02-20 14:02:50,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {404#false} is VALID [2022-02-20 14:02:50,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {404#false} is VALID [2022-02-20 14:02:50,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#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; {404#false} is VALID [2022-02-20 14:02:50,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#false} havoc main_~i~0#1;main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:50,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {543#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:50,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(< |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; {543#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:50,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#(< |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {547#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:50,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {547#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:50,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#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); {403#true} is VALID [2022-02-20 14:02:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:02:50,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061007857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:50,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:50,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:50,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320842048] [2022-02-20 14:02:50,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 25 [2022-02-20 14:02:50,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:50,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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:50,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:50,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:50,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:50,872 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,931 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-20 14:02:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 25 [2022-02-20 14:02:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:02:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:02:50,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 14:02:50,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:50,985 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:02:50,985 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:02:50,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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:50,987 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:50,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:02:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 14:02:50,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:50,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,999 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:51,000 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:51,013 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 14:02:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:51,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:51,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:51,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:02:51,015 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:02:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:51,016 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 14:02:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:51,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:51,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:51,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:51,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 14:02:51,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 25 [2022-02-20 14:02:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:51,017 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 14:02:51,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:02:51,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:51,019 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, 1, 1, 1, 1] [2022-02-20 14:02:51,056 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:51,227 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:51,227 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1256809879, now seen corresponding path program 2 times [2022-02-20 14:02:51,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:51,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183993948] [2022-02-20 14:02:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:51,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:51,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#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); {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {752#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {752#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {752#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {752#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {752#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {752#true} is VALID [2022-02-20 14:02:51,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {752#true} is VALID [2022-02-20 14:02:51,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {752#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {752#true} is VALID [2022-02-20 14:02:51,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {752#true} assume !(main_~a~0#1 < 100000); {752#true} is VALID [2022-02-20 14:02:51,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {752#true} havoc main_~i~0#1;main_~i~0#1 := 0; {754#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(= |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; {754#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#(= |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; {755#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {753#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {753#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} havoc main_~x~0#1;main_~x~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {753#false} is VALID [2022-02-20 14:02:52,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:52,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 14:02:52,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:52,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183993948] [2022-02-20 14:02:52,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183993948] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:52,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029776046] [2022-02-20 14:02:52,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:02:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:52,098 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:52,101 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:52,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:02:52,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:52,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:02:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:52,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:52,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#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); {752#true} is VALID [2022-02-20 14:02:52,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {762#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:52,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {762#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:52,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {762#(<= |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; {769#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:52,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {769#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {769#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:52,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#(<= |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; {776#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:52,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {776#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:52,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(<= |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; {783#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:52,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {783#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:52,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(<= |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; {790#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:52,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {790#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:52,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#false} havoc main_~i~0#1;main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#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; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {753#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {753#false} is VALID [2022-02-20 14:02:53,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} havoc main_~x~0#1;main_~x~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {753#false} is VALID [2022-02-20 14:02:53,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:53,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:02:53,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:53,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} havoc main_~x~0#1;main_~x~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {753#false} is VALID [2022-02-20 14:02:53,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {753#false} is VALID [2022-02-20 14:02:53,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#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; {753#false} is VALID [2022-02-20 14:02:53,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#false} havoc main_~i~0#1;main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:53,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {914#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:53,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(< |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; {914#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:53,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {918#(< |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {918#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:53,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(< |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; {918#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:53,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(< |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {925#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:53,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#(< |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; {925#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:53,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {932#(< |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {932#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:53,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {939#(< |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; {932#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:53,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {939#(< |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {939#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:53,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {939#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:53,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#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); {752#true} is VALID [2022-02-20 14:02:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:02:53,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029776046] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:53,708 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:53,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:02:53,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922217825] [2022-02-20 14:02:53,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 31 [2022-02-20 14:02:53,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:53,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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:53,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:53,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:02:53,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:02:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:53,757 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:53,997 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-02-20 14:02:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:02:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 31 [2022-02-20 14:02:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-02-20 14:02:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-02-20 14:02:54,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 96 transitions. [2022-02-20 14:02:54,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:54,100 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:02:54,100 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 14:02:54,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 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:54,101 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:54,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 14:02:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-02-20 14:02:54,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:54,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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:54,127 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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:54,127 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,128 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-02-20 14:02:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-20 14:02:54,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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 58 states. [2022-02-20 14:02:54,129 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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 58 states. [2022-02-20 14:02:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,130 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-02-20 14:02:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-20 14:02:54,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:54,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-02-20 14:02:54,132 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 31 [2022-02-20 14:02:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:54,132 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-02-20 14:02:54,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-02-20 14:02:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 14:02:54,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:54,133 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:54,151 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:54,343 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:54,343 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2044441341, now seen corresponding path program 3 times [2022-02-20 14:02:54,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:54,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136469391] [2022-02-20 14:02:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:54,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {1256#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); {1256#true} is VALID [2022-02-20 14:02:54,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1258#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:54,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#(= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1258#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:54,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {1258#(= |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; {1259#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:54,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {1259#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1259#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:54,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1259#(<= |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; {1260#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:54,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1260#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:54,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#(<= |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; {1261#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:54,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {1261#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1261#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:54,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {1261#(<= |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; {1262#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:54,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1262#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:54,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(<= |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; {1263#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:54,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1263#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:54,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1263#(<= |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; {1264#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:54,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {1264#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1264#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:54,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1264#(<= |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; {1265#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:54,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1265#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:54,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1265#(<= |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; {1266#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:54,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1266#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:54,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(<= |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; {1267#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:54,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {1267#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1267#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:54,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {1267#(<= |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; {1268#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:54,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {1268#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:54,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {1257#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:54,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {1257#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; {1257#false} is VALID [2022-02-20 14:02:54,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {1257#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1257#false} is VALID [2022-02-20 14:02:54,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#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; {1257#false} is VALID [2022-02-20 14:02:54,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {1257#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1257#false} is VALID [2022-02-20 14:02:54,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:54,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:54,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {1257#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1257#false} is VALID [2022-02-20 14:02:54,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1257#false} is VALID [2022-02-20 14:02:54,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {1257#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1257#false} is VALID [2022-02-20 14:02:54,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {1257#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1257#false} is VALID [2022-02-20 14:02:54,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:54,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:54,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {1257#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1257#false} is VALID [2022-02-20 14:02:54,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1257#false} is VALID [2022-02-20 14:02:54,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {1257#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1257#false} is VALID [2022-02-20 14:02:54,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {1257#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1257#false} is VALID [2022-02-20 14:02:54,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:54,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {1257#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:54,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1257#false} is VALID [2022-02-20 14:02:54,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:54,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:02:54,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:54,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136469391] [2022-02-20 14:02:54,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136469391] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:54,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170443761] [2022-02-20 14:02:54,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:02:54,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:54,614 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:54,638 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:54,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:02:54,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:54,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:02:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:54,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:54,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {1256#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); {1256#true} is VALID [2022-02-20 14:02:55,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {1256#true} assume !(main_~a~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {1256#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {1256#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; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {1256#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {1256#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; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {1256#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#true} main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {1256#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1256#true} is VALID [2022-02-20 14:02:55,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {1256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1256#true} is VALID [2022-02-20 14:02:55,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1256#true} is VALID [2022-02-20 14:02:55,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {1256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1256#true} is VALID [2022-02-20 14:02:55,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {1256#true} main_~i~0#1 := 0; {1377#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:55,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {1377#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1377#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:55,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {1377#(<= |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; {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:55,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {1384#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:55,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {1384#(<= |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; {1391#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:55,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:55,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {1257#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:55,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1257#false} is VALID [2022-02-20 14:02:55,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:55,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 14:02:55,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:55,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:55,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:55,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {1257#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1257#false} is VALID [2022-02-20 14:02:55,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:55,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {1455#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:55,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {1459#(< |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; {1455#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:55,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {1459#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:55,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#(< |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; {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:55,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1466#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {1256#true} main_~i~0#1 := 0; {1466#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {1256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {1256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {1256#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#true} main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {1256#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {1256#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; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1256#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1256#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; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1256#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {1256#true} assume !(main_~a~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {1256#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1256#true} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1256#true} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {1256#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); {1256#true} is VALID [2022-02-20 14:02:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 14:02:55,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170443761] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:55,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:55,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:02:55,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672577114] [2022-02-20 14:02:55,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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 51 [2022-02-20 14:02:55,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:55,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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:55,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:55,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:02:55,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:02:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:55,293 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:55,641 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-02-20 14:02:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:02:55,641 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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 51 [2022-02-20 14:02:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2022-02-20 14:02:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2022-02-20 14:02:55,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2022-02-20 14:02:55,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:55,746 INFO L225 Difference]: With dead ends: 120 [2022-02-20 14:02:55,746 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 14:02:55,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 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:55,747 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:55,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 77 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 14:02:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-02-20 14:02:55,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:55,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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:55,778 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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:55,778 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:55,780 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 14:02:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 14:02:55,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:55,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:55,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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 89 states. [2022-02-20 14:02:55,781 INFO L87 Difference]: Start difference. First operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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 89 states. [2022-02-20 14:02:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:55,782 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 14:02:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 14:02:55,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:55,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:55,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:55,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 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:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-02-20 14:02:55,785 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 51 [2022-02-20 14:02:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:55,785 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-02-20 14:02:55,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 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:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-02-20 14:02:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 14:02:55,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:55,786 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:55,810 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:56,009 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:56,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1514226337, now seen corresponding path program 4 times [2022-02-20 14:02:56,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:56,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795705562] [2022-02-20 14:02:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:56,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {2058#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); {2058#true} is VALID [2022-02-20 14:02:56,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2060#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:56,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2060#(= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2060#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:56,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {2060#(= |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; {2061#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:56,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {2061#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2061#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:56,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {2061#(<= |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; {2062#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:56,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {2062#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2062#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:56,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {2062#(<= |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; {2063#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:56,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2063#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:56,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#(<= |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; {2064#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:56,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {2064#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2064#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:56,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {2064#(<= |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; {2065#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:56,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2065#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:56,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {2065#(<= |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; {2066#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:56,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {2066#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2066#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:56,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {2066#(<= |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; {2067#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:56,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {2067#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2067#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:56,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {2067#(<= |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; {2068#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:56,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {2068#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2068#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:56,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {2068#(<= |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; {2069#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:56,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {2069#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2069#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:56,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {2069#(<= |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; {2070#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:56,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {2070#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2070#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:56,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= |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; {2071#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_~a~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {2059#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {2059#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; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {2059#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {2059#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {2059#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {2059#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {2059#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,309 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,309 INFO L290 TraceCheckUtils]: 81: Hoare triple {2059#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2059#false} is VALID [2022-02-20 14:02:56,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:56,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 14:02:56,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:56,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795705562] [2022-02-20 14:02:56,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795705562] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:56,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279218181] [2022-02-20 14:02:56,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:02:56,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:56,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:56,313 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:56,314 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:56,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:02:56,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:56,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:02:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:56,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:56,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {2058#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); {2058#true} is VALID [2022-02-20 14:02:56,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:56,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {2058#true} assume !(main_~a~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {2058#true} havoc main_~i~0#1;main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {2058#true} main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 49: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 51: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:56,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:56,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {2058#true} main_~i~0#1 := 0; {2234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:56,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {2234#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:56,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {2234#(<= |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; {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:56,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {2241#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:56,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {2241#(<= |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; {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:56,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {2248#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:56,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {2248#(<= |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; {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:56,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {2255#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:56,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {2255#(<= |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; {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:56,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {2262#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:56,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {2262#(<= |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; {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:56,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {2269#(<= |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:56,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {2269#(<= |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; {2276#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:02:56,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {2276#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:56,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {2059#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:56,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2059#false} is VALID [2022-02-20 14:02:56,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:56,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-02-20 14:02:56,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:57,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:57,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:57,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2059#false} is VALID [2022-02-20 14:02:57,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {2059#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2059#false} is VALID [2022-02-20 14:02:57,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:57,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {2388#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:57,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {2392#(< |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; {2388#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:57,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {2392#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:57,162 INFO L290 TraceCheckUtils]: 63: Hoare triple {2399#(< |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; {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:57,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {2399#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:57,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {2406#(< |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; {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:57,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {2406#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:57,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {2413#(< |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; {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:57,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {2413#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:57,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {2420#(< |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; {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:57,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {2420#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:57,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {2427#(< |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; {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:57,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {2427#(< |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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2427#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:02:57,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {2058#true} main_~i~0#1 := 0; {2427#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {2058#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {2058#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {2058#true} main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#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; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {2058#true} havoc main_~i~0#1;main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {2058#true} assume !(main_~a~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2058#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2058#true} is VALID [2022-02-20 14:02:57,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {2058#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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2058#true} is VALID [2022-02-20 14:02:57,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:57,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {2058#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); {2058#true} is VALID [2022-02-20 14:02:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-02-20 14:02:57,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279218181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:57,172 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:57,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-02-20 14:02:57,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879370334] [2022-02-20 14:02:57,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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 85 [2022-02-20 14:02:57,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:57,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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:57,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:57,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-20 14:02:57,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-20 14:02:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:02:57,241 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:57,769 INFO L93 Difference]: Finished difference Result 218 states and 260 transitions. [2022-02-20 14:02:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 14:02:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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 85 [2022-02-20 14:02:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 216 transitions. [2022-02-20 14:02:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 216 transitions. [2022-02-20 14:02:57,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 216 transitions. [2022-02-20 14:02:57,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:57,946 INFO L225 Difference]: With dead ends: 218 [2022-02-20 14:02:57,946 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 14:02:57,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 156 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:57,947 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 123 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:57,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 70 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:02:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 14:02:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-02-20 14:02:58,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:58,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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:58,002 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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:58,003 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:58,006 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-02-20 14:02:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2022-02-20 14:02:58,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:58,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:58,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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 155 states. [2022-02-20 14:02:58,007 INFO L87 Difference]: Start difference. First operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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 155 states. [2022-02-20 14:02:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:58,010 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-02-20 14:02:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2022-02-20 14:02:58,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:58,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:58,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:58,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.0392156862745099) internal successors, (159), 153 states have internal predecessors, (159), 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:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2022-02-20 14:02:58,014 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 85 [2022-02-20 14:02:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:58,015 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2022-02-20 14:02:58,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 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:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2022-02-20 14:02:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-20 14:02:58,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:58,016 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:58,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 14:02:58,235 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:58,236 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash -44527969, now seen corresponding path program 5 times [2022-02-20 14:02:58,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:58,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678033238] [2022-02-20 14:02:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:58,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {3451#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); {3451#true} is VALID [2022-02-20 14:02:58,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#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~post10#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#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_~#a5~0#1.base, main_~#a5~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);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3453#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:58,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {3453#(= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3453#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:58,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {3453#(= |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; {3454#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:58,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {3454#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3454#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:58,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {3454#(<= |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; {3455#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:58,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {3455#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3455#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:58,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {3455#(<= |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; {3456#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:58,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3456#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3456#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:58,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {3456#(<= |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; {3457#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:58,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {3457#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3457#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:58,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#(<= |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; {3458#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:58,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3458#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:58,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {3458#(<= |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; {3459#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:58,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {3459#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3459#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:58,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {3459#(<= |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; {3460#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:58,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {3460#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3460#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:58,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {3460#(<= |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; {3461#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:58,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {3461#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3461#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:58,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {3461#(<= |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; {3462#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:58,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {3462#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3462#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:58,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {3462#(<= |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; {3463#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:58,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3463#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:58,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3463#(<= |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; {3464#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:58,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {3464#(<= |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_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3464#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {3464#(<= |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; {3465#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {3465#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_~a~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {3452#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {3452#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; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {3452#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#false} is VALID [2022-02-20 14:02:58,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 83: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 84: Hoare triple {3452#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_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 85: Hoare triple {3452#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 86: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 87: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 88: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 89: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 91: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 92: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 101: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 104: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,488 INFO L290 TraceCheckUtils]: 107: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 109: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 110: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 111: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 112: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 113: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 114: Hoare triple {3452#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_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 115: Hoare triple {3452#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3452#false} is VALID [2022-02-20 14:02:58,489 INFO L290 TraceCheckUtils]: 116: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 117: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 118: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 119: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 120: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 123: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,490 INFO L290 TraceCheckUtils]: 124: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 125: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 126: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 127: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 128: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 129: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 130: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 131: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 132: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,491 INFO L290 TraceCheckUtils]: 133: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 134: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 135: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 136: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 137: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 138: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 139: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 140: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 141: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,492 INFO L290 TraceCheckUtils]: 142: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 143: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 144: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 145: Hoare triple {3452#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 146: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 147: Hoare triple {3452#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 148: Hoare triple {3452#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem14#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 149: Hoare triple {3452#false} assume 0 == __VERIFIER_assert_~cond#1; {3452#false} is VALID [2022-02-20 14:02:58,493 INFO L290 TraceCheckUtils]: 150: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-02-20 14:02:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-02-20 14:02:58,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:58,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678033238] [2022-02-20 14:02:58,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678033238] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:58,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789741154] [2022-02-20 14:02:58,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:02:58,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:58,512 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:58,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process