./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy4_ground-1.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-1.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 46a2982bcd9fbf87ad95f35e8d160ffed7259af3c1cb1d5fe78d4df5a4783123 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:38,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:38,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:38,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:38,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:38,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:38,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:38,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:38,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:38,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:38,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:38,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:38,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:38,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:38,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:38,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:38,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:38,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:38,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:38,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:38,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:38,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:38,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:38,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:38,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:38,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:38,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:38,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:38,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:38,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:38,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:38,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:38,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:38,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:38,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:38,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:38,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:38,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:38,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:38,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:38,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:38,738 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:38,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:38,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:38,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:38,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:38,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:38,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:38,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:38,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:38,765 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:38,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:38,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:38,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:38,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:38,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:38,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:38,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:38,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:38,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:38,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:38,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:38,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:38,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:38,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:38,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:38,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:38,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:38,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:38,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:38,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:38,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:38,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:38,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:38,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:38,772 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 -> 46a2982bcd9fbf87ad95f35e8d160ffed7259af3c1cb1d5fe78d4df5a4783123 [2022-02-20 14:02:39,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:39,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:39,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:39,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:39,085 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:39,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy4_ground-1.i [2022-02-20 14:02:39,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1010b99e/2d20ee5c7da24811869d9f5b61c9a8de/FLAG1506574d6 [2022-02-20 14:02:41,368 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:41,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy4_ground-1.i [2022-02-20 14:02:41,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1010b99e/2d20ee5c7da24811869d9f5b61c9a8de/FLAG1506574d6 [2022-02-20 14:02:41,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1010b99e/2d20ee5c7da24811869d9f5b61c9a8de [2022-02-20 14:02:41,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:41,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:41,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:41,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:41,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:41,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:41" (1/1) ... [2022-02-20 14:02:41,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2104ae9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:41, skipping insertion in model container [2022-02-20 14:02:41,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:41" (1/1) ... [2022-02-20 14:02:42,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:42,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:42,683 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-1.i[816,829] [2022-02-20 14:02:42,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:42,716 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:42,727 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-1.i[816,829] [2022-02-20 14:02:42,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:42,749 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:42,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:42 WrapperNode [2022-02-20 14:02:42,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:42,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:42,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:42,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:42,757 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:42" (1/1) ... [2022-02-20 14:02:42,763 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:42" (1/1) ... [2022-02-20 14:02:42,800 INFO L137 Inliner]: procedures = 16, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112 [2022-02-20 14:02:42,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:42,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:42,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:42,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:42,808 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:42" (1/1) ... [2022-02-20 14:02:42,808 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:42" (1/1) ... [2022-02-20 14:02:42,811 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:42" (1/1) ... [2022-02-20 14:02:42,811 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:42" (1/1) ... [2022-02-20 14:02:42,834 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:42" (1/1) ... [2022-02-20 14:02:42,838 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:42" (1/1) ... [2022-02-20 14:02:42,839 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:42" (1/1) ... [2022-02-20 14:02:42,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:42,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:42,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:42,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:42,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:42" (1/1) ... [2022-02-20 14:02:43,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:43,911 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:43,920 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:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:44,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:44,099 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:44,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:44,327 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:44,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:44,333 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 14:02:44,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:44 BoogieIcfgContainer [2022-02-20 14:02:44,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:44,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:44,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:44,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:44,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:41" (1/3) ... [2022-02-20 14:02:44,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5087dbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:44, skipping insertion in model container [2022-02-20 14:02:44,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:42" (2/3) ... [2022-02-20 14:02:44,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5087dbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:44, skipping insertion in model container [2022-02-20 14:02:44,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:44" (3/3) ... [2022-02-20 14:02:44,359 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-1.i [2022-02-20 14:02:44,364 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:44,365 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:44,442 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:44,448 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:44,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:44,485 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:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:02:44,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:44,490 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:44,490 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1890477095, now seen corresponding path program 1 times [2022-02-20 14:02:44,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:44,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360319838] [2022-02-20 14:02:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:44,817 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:44,819 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:44,821 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:44,821 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:44,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:44,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:44,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:44,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:44,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:44,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} main_~i~0#1 := 0; {31#false} is VALID [2022-02-20 14:02:44,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} assume !(main_~i~0#1 < 100000); {31#false} is VALID [2022-02-20 14:02:44,823 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:44,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:44,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == __VERIFIER_assert_~cond#1; {31#false} is VALID [2022-02-20 14:02:44,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 14:02:44,826 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:44,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:44,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360319838] [2022-02-20 14:02:44,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360319838] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:44,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:44,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:44,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104309440] [2022-02-20 14:02:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:44,837 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:44,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:44,843 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:44,875 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:44,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:44,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:44,903 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:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,012 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2022-02-20 14:02:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:45,013 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:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:45,015 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:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-20 14:02:45,026 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:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-20 14:02:45,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-02-20 14:02:45,115 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:45,128 INFO L225 Difference]: With dead ends: 52 [2022-02-20 14:02:45,129 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:02:45,132 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:45,135 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:45,136 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:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:02:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 14:02:45,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:45,166 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:45,167 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:45,167 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:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,177 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:02:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:02:45,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,180 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:45,181 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:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,184 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:02:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:02:45,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:45,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:45,186 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:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 14:02:45,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-02-20 14:02:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:45,191 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 14:02:45,191 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:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:02:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:02:45,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:45,194 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:45,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:02:45,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1812867813, now seen corresponding path program 1 times [2022-02-20 14:02:45,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:45,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080435882] [2022-02-20 14:02:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,275 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:45,276 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:45,277 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; {184#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,277 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:45,278 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:45,279 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:45,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,281 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:45,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:45,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {183#false} assume 0 == __VERIFIER_assert_~cond#1; {183#false} is VALID [2022-02-20 14:02:45,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 14:02:45,282 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:45,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:45,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080435882] [2022-02-20 14:02:45,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080435882] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:45,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416272503] [2022-02-20 14:02:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:45,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:45,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:45,291 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:45,314 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:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:02:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:45,457 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:45,457 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:45,457 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; {182#true} is VALID [2022-02-20 14:02:45,458 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:45,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} assume !(main_~a~0#1 < 100000); {182#true} is VALID [2022-02-20 14:02:45,458 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:45,459 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:45,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_~i~0#1 := 0; {183#false} is VALID [2022-02-20 14:02:45,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} assume !(main_~i~0#1 < 100000); {183#false} is VALID [2022-02-20 14:02:45,461 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:45,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:45,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {183#false} assume 0 == __VERIFIER_assert_~cond#1; {183#false} is VALID [2022-02-20 14:02:45,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 14:02:45,461 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:45,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:02:45,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416272503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:45,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:02:45,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:02:45,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39510141] [2022-02-20 14:02:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:45,468 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:45,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:45,470 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:45,485 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:45,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:45,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:45,489 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:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,588 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-02-20 14:02:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:45,589 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:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:45,590 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:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:02:45,593 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:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 14:02:45,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-02-20 14:02:45,663 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:45,664 INFO L225 Difference]: With dead ends: 48 [2022-02-20 14:02:45,664 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:02:45,665 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:45,666 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:45,667 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:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:02:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 14:02:45,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:45,675 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:45,675 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:45,675 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:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,677 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 14:02:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 14:02:45,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,680 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:45,680 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:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,683 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 14:02:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 14:02:45,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:45,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:45,685 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:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 14:02:45,686 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2022-02-20 14:02:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:45,686 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 14:02:45,687 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:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 14:02:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:02:45,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:45,688 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:45,716 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:45,906 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:45,906 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2029995939, now seen corresponding path program 1 times [2022-02-20 14:02:45,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:45,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978626566] [2022-02-20 14:02:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,985 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:45,985 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:45,986 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; {405#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,986 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:45,987 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:45,987 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:45,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {404#false} is VALID [2022-02-20 14:02:45,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {404#false} is VALID [2022-02-20 14:02:45,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:45,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:46,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {404#false} is VALID [2022-02-20 14:02:46,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {404#false} is VALID [2022-02-20 14:02:46,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:46,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:46,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {404#false} is VALID [2022-02-20 14:02:46,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-20 14:02:46,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:46,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:46,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {404#false} is VALID [2022-02-20 14:02:46,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {404#false} is VALID [2022-02-20 14:02:46,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:46,050 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:46,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:46,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:46,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:46,051 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:46,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:46,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978626566] [2022-02-20 14:02:46,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978626566] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:46,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472475243] [2022-02-20 14:02:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:46,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:46,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:46,135 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:46,138 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:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:46,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:46,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:47,064 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:47,065 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:47,066 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; {413#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:47,066 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:47,067 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:47,067 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:47,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {404#false} is VALID [2022-02-20 14:02:47,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {404#false} is VALID [2022-02-20 14:02:47,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,070 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:47,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:47,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:47,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:47,070 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:47,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:47,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {404#false} assume !false; {404#false} is VALID [2022-02-20 14:02:47,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {404#false} assume 0 == __VERIFIER_assert_~cond#1; {404#false} is VALID [2022-02-20 14:02:47,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {404#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:47,820 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:47,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {404#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {404#false} is VALID [2022-02-20 14:02:47,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {404#false} is VALID [2022-02-20 14:02:47,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-20 14:02:47,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {404#false} is VALID [2022-02-20 14:02:47,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {404#false} is VALID [2022-02-20 14:02:47,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {404#false} is VALID [2022-02-20 14:02:47,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} main_~i~0#1 := 0; {404#false} is VALID [2022-02-20 14:02:47,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume !(main_~i~0#1 < 100000); {404#false} is VALID [2022-02-20 14:02:47,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {404#false} is VALID [2022-02-20 14:02:47,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {404#false} is VALID [2022-02-20 14:02:47,832 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:47,833 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:47,833 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:47,834 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; {547#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:47,835 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:47,835 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:47,836 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:47,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472475243] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:47,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:47,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:47,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308954749] [2022-02-20 14:02:47,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:47,838 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:47,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:47,839 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:47,875 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:47,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:47,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:47,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:47,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:47,876 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:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:47,964 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-20 14:02:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:47,964 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:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:47,964 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:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:02:47,966 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:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:02:47,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 14:02:48,029 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:48,030 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:02:48,031 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:02:48,031 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:48,032 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:48,088 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:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:02:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 14:02:48,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:48,096 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:48,096 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:48,096 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:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:48,098 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 14:02:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:48,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:48,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:48,099 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:48,099 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:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:48,101 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 14:02:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:48,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:48,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:48,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:48,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:48,781 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:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 14:02:48,783 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 25 [2022-02-20 14:02:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:48,783 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 14:02:48,784 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:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:02:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:02:48,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:48,785 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:48,816 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:48,999 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:49,000 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1256809879, now seen corresponding path program 2 times [2022-02-20 14:02:49,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:49,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372775107] [2022-02-20 14:02:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,080 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:49,081 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:49,081 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; {752#true} is VALID [2022-02-20 14:02:49,082 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:49,082 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; {752#true} is VALID [2022-02-20 14:02:49,082 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:49,082 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; {752#true} is VALID [2022-02-20 14:02:49,083 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:49,083 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; {752#true} is VALID [2022-02-20 14:02:49,083 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:49,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {752#true} assume !(main_~a~0#1 < 100000); {752#true} is VALID [2022-02-20 14:02:49,084 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:49,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {754#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:49,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {755#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:49,085 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:49,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {753#false} is VALID [2022-02-20 14:02:49,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {753#false} is VALID [2022-02-20 14:02:49,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {753#false} is VALID [2022-02-20 14:02:49,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {753#false} is VALID [2022-02-20 14:02:49,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {753#false} is VALID [2022-02-20 14:02:49,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {753#false} is VALID [2022-02-20 14:02:49,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,088 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:49,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:49,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:49,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:49,089 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:49,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372775107] [2022-02-20 14:02:49,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372775107] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:49,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152942084] [2022-02-20 14:02:49,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:02:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:49,092 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:49,096 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:49,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:02:49,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:49,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:02:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:49,344 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:49,345 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:49,346 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; {762#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,346 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:49,347 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; {769#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:49,347 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:49,348 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; {776#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:49,350 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:49,350 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; {783#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:49,351 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:49,352 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:49,352 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:49,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {753#false} is VALID [2022-02-20 14:02:49,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {753#false} is VALID [2022-02-20 14:02:49,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {753#false} is VALID [2022-02-20 14:02:49,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {753#false} is VALID [2022-02-20 14:02:49,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,354 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:49,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:49,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:49,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:49,355 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:49,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:49,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:02:49,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:02:49,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:49,529 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:49,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {753#false} is VALID [2022-02-20 14:02:49,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {753#false} is VALID [2022-02-20 14:02:49,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {753#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {753#false} is VALID [2022-02-20 14:02:49,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {753#false} is VALID [2022-02-20 14:02:49,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {753#false} is VALID [2022-02-20 14:02:49,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {753#false} is VALID [2022-02-20 14:02:49,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#false} main_~i~0#1 := 0; {753#false} is VALID [2022-02-20 14:02:49,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#false} assume !(main_~i~0#1 < 100000); {753#false} is VALID [2022-02-20 14:02:49,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {753#false} is VALID [2022-02-20 14:02:49,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {753#false} is VALID [2022-02-20 14:02:49,537 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:49,539 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:49,545 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:49,546 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; {918#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:49,546 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:49,547 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; {925#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:49,547 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:49,548 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; {932#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:49,548 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:49,549 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; {939#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:49,550 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:49,550 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:49,550 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:49,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152942084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:49,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:49,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:02:49,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196928373] [2022-02-20 14:02:49,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:49,553 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:49,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:49,554 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:49,588 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:49,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:02:49,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:02:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:49,591 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:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,877 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-02-20 14:02:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:02:49,877 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:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:49,878 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:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-02-20 14:02:49,880 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:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-02-20 14:02:49,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 96 transitions. [2022-02-20 14:02:49,952 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:49,953 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:02:49,953 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 14:02:49,954 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:49,955 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:49,955 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:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 14:02:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-02-20 14:02:49,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:49,982 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:49,983 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:49,983 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:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,986 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-02-20 14:02:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-20 14:02:49,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,988 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:49,989 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:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,993 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-02-20 14:02:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-20 14:02:49,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:49,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:49,999 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:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-02-20 14:02:50,001 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 31 [2022-02-20 14:02:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:50,002 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-02-20 14:02:50,002 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:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-02-20 14:02:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 14:02:50,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:50,006 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:50,034 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:50,218 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:50,219 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2044441341, now seen corresponding path program 3 times [2022-02-20 14:02:50,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:50,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207837156] [2022-02-20 14:02:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,434 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:50,435 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:50,435 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; {1258#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,436 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:50,436 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; {1259#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:50,436 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:50,437 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; {1260#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:50,437 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:50,438 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; {1261#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:50,438 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:50,439 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; {1262#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:50,439 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:50,440 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; {1263#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:50,440 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:50,441 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; {1264#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:50,441 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:50,442 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; {1265#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:50,442 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:50,443 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; {1266#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:50,443 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:50,444 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; {1267#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:50,444 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:50,445 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:50,445 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:50,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {1257#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {1257#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:50,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1257#false} is VALID [2022-02-20 14:02:50,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1257#false} is VALID [2022-02-20 14:02:50,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1257#false} is VALID [2022-02-20 14:02:50,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {1257#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1257#false} is VALID [2022-02-20 14:02:50,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:50,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1257#false} is VALID [2022-02-20 14:02:50,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1257#false} is VALID [2022-02-20 14:02:50,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1257#false} is VALID [2022-02-20 14:02:50,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {1257#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1257#false} is VALID [2022-02-20 14:02:50,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,450 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:50,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:50,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:50,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:50,451 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:50,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:50,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207837156] [2022-02-20 14:02:50,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207837156] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:50,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364599303] [2022-02-20 14:02:50,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:02:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:50,453 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:50,459 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:50,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:02:50,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:50,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:02:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:50,764 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:50,765 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:50,765 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; {1256#true} is VALID [2022-02-20 14:02:50,765 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:50,765 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; {1256#true} is VALID [2022-02-20 14:02:50,765 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:50,765 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; {1256#true} is VALID [2022-02-20 14:02:50,766 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:50,766 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; {1256#true} is VALID [2022-02-20 14:02:50,767 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:50,767 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; {1256#true} is VALID [2022-02-20 14:02:50,767 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:50,768 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; {1256#true} is VALID [2022-02-20 14:02:50,768 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:50,768 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; {1256#true} is VALID [2022-02-20 14:02:50,768 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:50,768 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; {1256#true} is VALID [2022-02-20 14:02:50,769 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:50,769 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; {1256#true} is VALID [2022-02-20 14:02:50,769 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:50,769 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; {1256#true} is VALID [2022-02-20 14:02:50,769 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:50,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {1256#true} assume !(main_~a~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,770 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:50,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1256#true} is VALID [2022-02-20 14:02:50,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {1256#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1256#true} is VALID [2022-02-20 14:02:50,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1256#true} is VALID [2022-02-20 14:02:50,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {1256#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1256#true} is VALID [2022-02-20 14:02:50,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#true} main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:50,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1256#true} is VALID [2022-02-20 14:02:50,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {1256#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1256#true} is VALID [2022-02-20 14:02:50,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1256#true} is VALID [2022-02-20 14:02:50,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {1256#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1256#true} is VALID [2022-02-20 14:02:50,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,773 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:50,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {1377#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1377#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:50,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {1377#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:50,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:50,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:50,775 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:50,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:50,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,777 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:50,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:50,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:50,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:50,778 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:50,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:50,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-02-20 14:02:50,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {1257#false} assume 0 == __VERIFIER_assert_~cond#1; {1257#false} is VALID [2022-02-20 14:02:50,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {1257#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:50,942 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:50,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {1257#false} assume !(main_~i~0#1 < 100000); {1257#false} is VALID [2022-02-20 14:02:50,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {1257#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1257#false} is VALID [2022-02-20 14:02:50,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {1257#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1257#false} is VALID [2022-02-20 14:02:50,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {1257#false} main_~i~0#1 := 0; {1257#false} is VALID [2022-02-20 14:02:50,948 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:50,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1455#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:50,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:50,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1459#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:50,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1466#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:50,951 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:50,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {1256#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1256#true} is VALID [2022-02-20 14:02:50,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1256#true} is VALID [2022-02-20 14:02:50,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {1256#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1256#true} is VALID [2022-02-20 14:02:50,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1256#true} is VALID [2022-02-20 14:02:50,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {1256#true} main_~i~0#1 := 0; {1256#true} is VALID [2022-02-20 14:02:50,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1256#true} assume !(main_~i~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {1256#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1256#true} is VALID [2022-02-20 14:02:50,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1256#true} is VALID [2022-02-20 14:02:50,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {1256#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1256#true} is VALID [2022-02-20 14:02:50,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {1256#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1256#true} is VALID [2022-02-20 14:02:50,953 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:50,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {1256#true} assume !(main_~a~0#1 < 100000); {1256#true} is VALID [2022-02-20 14:02:50,953 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:50,954 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; {1256#true} is VALID [2022-02-20 14:02:50,954 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:50,954 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; {1256#true} is VALID [2022-02-20 14:02:50,954 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:50,954 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; {1256#true} is VALID [2022-02-20 14:02:50,954 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:50,955 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; {1256#true} is VALID [2022-02-20 14:02:50,955 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:50,955 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; {1256#true} is VALID [2022-02-20 14:02:50,955 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:50,955 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; {1256#true} is VALID [2022-02-20 14:02:50,956 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:50,956 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; {1256#true} is VALID [2022-02-20 14:02:50,956 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:50,956 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; {1256#true} is VALID [2022-02-20 14:02:50,956 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:50,956 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; {1256#true} is VALID [2022-02-20 14:02:50,957 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:50,957 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; {1256#true} is VALID [2022-02-20 14:02:50,957 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:50,957 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:50,959 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:50,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364599303] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:50,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:50,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:02:50,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847387445] [2022-02-20 14:02:50,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:50,962 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:50,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:50,964 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:51,027 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:51,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:02:51,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:02:51,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:51,029 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:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:51,338 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-02-20 14:02:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:02:51,338 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:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:51,339 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:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2022-02-20 14:02:51,342 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:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2022-02-20 14:02:51,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2022-02-20 14:02:51,461 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:51,463 INFO L225 Difference]: With dead ends: 120 [2022-02-20 14:02:51,463 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 14:02:51,464 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:51,465 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:51,465 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:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 14:02:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-02-20 14:02:51,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:51,494 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:51,494 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:51,495 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:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:51,497 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 14:02:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 14:02:51,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:51,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:51,498 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:51,499 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:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:51,501 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 14:02:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 14:02:51,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:51,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:51,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:51,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:51,502 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:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-02-20 14:02:51,505 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 51 [2022-02-20 14:02:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:51,505 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-02-20 14:02:51,506 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:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-02-20 14:02:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 14:02:51,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:51,507 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:51,537 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:51,721 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:51,722 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1514226337, now seen corresponding path program 4 times [2022-02-20 14:02:51,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:51,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083226663] [2022-02-20 14:02:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:51,944 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:51,945 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:51,951 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; {2060#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:51,951 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:51,952 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; {2061#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:51,952 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:51,953 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; {2062#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:51,953 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:51,954 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; {2063#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:51,954 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:51,955 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; {2064#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:51,955 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:51,956 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; {2065#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:51,956 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:51,956 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; {2066#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:51,957 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:51,957 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; {2067#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:51,958 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:51,958 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; {2068#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:51,959 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:51,959 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; {2069#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:51,960 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:51,960 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; {2070#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:51,961 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:51,961 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:51,961 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:51,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2059#false} is VALID [2022-02-20 14:02:51,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {2059#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {2059#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 53: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 55: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,966 INFO L290 TraceCheckUtils]: 56: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {2059#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:51,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:51,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:51,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:51,970 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:51,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:51,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:51,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:51,971 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:51,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:51,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083226663] [2022-02-20 14:02:51,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083226663] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:51,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654968078] [2022-02-20 14:02:51,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:02:51,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:51,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:51,974 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:51,998 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:52,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:02:52,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:52,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:02:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:52,460 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:52,460 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:52,460 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,461 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:52,461 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; {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 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; {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 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; {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 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; {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 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; {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {2058#true} assume !(main_~a~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:52,462 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:52,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {2058#true} main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:52,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:52,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:52,471 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:52,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2234#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:52,473 INFO L290 TraceCheckUtils]: 55: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:52,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:52,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {2241#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:52,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:52,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {2248#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:52,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:02:52,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {2255#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:52,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:02:52,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {2262#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:52,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:02:52,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {2269#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2276#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:02:52,478 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:52,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:52,482 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:52,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:52,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:52,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:52,483 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:52,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:52,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {2059#false} assume !false; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {2059#false} assume 0 == __VERIFIER_assert_~cond#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {2059#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:52,825 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:52,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {2059#false} assume !(main_~i~0#1 < 100000); {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 79: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {2059#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {2059#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2059#false} is VALID [2022-02-20 14:02:52,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {2059#false} main_~i~0#1 := 0; {2059#false} is VALID [2022-02-20 14:02:52,831 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:52,832 INFO L290 TraceCheckUtils]: 65: Hoare triple {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2388#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:52,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:52,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2392#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:52,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:52,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2399#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:52,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:52,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2406#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:02:52,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:52,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2413#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:02:52,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:52,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {2427#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2420#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:02:52,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {2427#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2427#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:02:52,839 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:52,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:53,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {2058#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {2058#true} main_~i~0#1 := 0; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {2058#true} assume !(main_~i~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2058#true} is VALID [2022-02-20 14:02:53,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2058#true} is VALID [2022-02-20 14:02:53,098 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:53,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {2058#true} assume !(main_~a~0#1 < 100000); {2058#true} is VALID [2022-02-20 14:02:53,098 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:53,099 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; {2058#true} is VALID [2022-02-20 14:02:53,099 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:53,099 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; {2058#true} is VALID [2022-02-20 14:02:53,099 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:53,099 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,100 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,100 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,100 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,100 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,100 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; {2058#true} is VALID [2022-02-20 14:02:53,100 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:53,101 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; {2058#true} is VALID [2022-02-20 14:02:53,101 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:53,101 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; {2058#true} is VALID [2022-02-20 14:02:53,101 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:53,101 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; {2058#true} is VALID [2022-02-20 14:02:53,101 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:53,101 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:53,102 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:53,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654968078] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:53,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:53,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-02-20 14:02:53,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887567834] [2022-02-20 14:02:53,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:53,106 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:53,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:53,107 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:53,201 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:53,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-20 14:02:53,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-20 14:02:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:02:53,203 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:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:53,835 INFO L93 Difference]: Finished difference Result 218 states and 260 transitions. [2022-02-20 14:02:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 14:02:53,836 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:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:53,836 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:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 216 transitions. [2022-02-20 14:02:53,840 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:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 216 transitions. [2022-02-20 14:02:53,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 216 transitions. [2022-02-20 14:02:54,001 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:54,005 INFO L225 Difference]: With dead ends: 218 [2022-02-20 14:02:54,006 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 14:02:54,006 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:54,007 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 123 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:54,008 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.3s Time] [2022-02-20 14:02:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 14:02:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-02-20 14:02:54,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:54,083 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:54,083 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:54,084 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:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,088 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-02-20 14:02:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2022-02-20 14:02:54,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,089 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:54,090 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:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,094 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-02-20 14:02:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2022-02-20 14:02:54,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:54,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:54,095 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:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2022-02-20 14:02:54,100 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 85 [2022-02-20 14:02:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:54,100 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2022-02-20 14:02:54,101 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:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2022-02-20 14:02:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-20 14:02:54,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:54,102 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:54,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:54,319 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:54,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:54,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash -44527969, now seen corresponding path program 5 times [2022-02-20 14:02:54,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:54,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982073483] [2022-02-20 14:02:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:54,603 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:54,605 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~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post11#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:54,605 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; {3453#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:54,606 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:54,606 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; {3454#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:54,606 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:54,607 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; {3455#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:54,607 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:54,607 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; {3456#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:54,608 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:54,608 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; {3457#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:54,608 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:54,609 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; {3458#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:54,609 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:54,610 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; {3459#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:54,610 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:54,610 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; {3460#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:54,611 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:54,611 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; {3461#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:54,611 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:54,612 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; {3462#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:54,612 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:54,612 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; {3463#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:54,613 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:54,613 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; {3464#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:54,613 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:54,614 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:54,614 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:54,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {3452#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3452#false} is VALID [2022-02-20 14:02:54,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 72: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,622 INFO L290 TraceCheckUtils]: 80: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 83: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {3452#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3452#false} is VALID [2022-02-20 14:02:54,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 87: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,624 INFO L290 TraceCheckUtils]: 93: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 94: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,625 INFO L290 TraceCheckUtils]: 99: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 101: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 102: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 103: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 104: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,626 INFO L290 TraceCheckUtils]: 105: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 108: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 109: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 110: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,627 INFO L290 TraceCheckUtils]: 111: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {3452#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 117: Hoare triple {3452#false} main_~i~0#1 := 0; {3452#false} is VALID [2022-02-20 14:02:54,628 INFO L290 TraceCheckUtils]: 118: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 119: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 120: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 121: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 122: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 123: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,629 INFO L290 TraceCheckUtils]: 124: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 125: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 126: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 127: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 128: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 129: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 130: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 131: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 132: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 133: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 134: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,630 INFO L290 TraceCheckUtils]: 135: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 136: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 137: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 138: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 139: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 140: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 141: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 142: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 143: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 144: Hoare triple {3452#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 145: Hoare triple {3452#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3452#false} is VALID [2022-02-20 14:02:54,631 INFO L290 TraceCheckUtils]: 146: Hoare triple {3452#false} assume !(main_~i~0#1 < 100000); {3452#false} is VALID [2022-02-20 14:02:54,631 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:54,631 INFO L290 TraceCheckUtils]: 148: Hoare triple {3452#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem13#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~mem12#1 == main_#t~mem13#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:54,632 INFO L290 TraceCheckUtils]: 149: Hoare triple {3452#false} assume 0 == __VERIFIER_assert_~cond#1; {3452#false} is VALID [2022-02-20 14:02:54,632 INFO L290 TraceCheckUtils]: 150: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-02-20 14:02:54,632 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:54,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:54,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982073483] [2022-02-20 14:02:54,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982073483] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:54,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545806951] [2022-02-20 14:02:54,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:02:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:54,638 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:54,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process