./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_sentinel.i.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_sentinel.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6060f0df556deb332d160eff8a39bcf699b67887fb6a475da5cd3837f5257af8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:07:44,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:07:44,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:07:44,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:07:44,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:07:44,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:07:44,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:07:44,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:07:44,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:07:44,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:07:44,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:07:44,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:07:44,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:07:44,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:07:44,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:07:44,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:07:44,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:07:44,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:07:44,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:07:44,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:07:44,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:07:44,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:07:44,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:07:44,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:07:44,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:07:44,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:07:44,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:07:44,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:07:44,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:07:44,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:07:44,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:07:44,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:07:44,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:07:44,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:07:44,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:07:44,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:07:44,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:07:44,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:07:44,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:07:44,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:07:44,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:07:44,986 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:07:45,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:07:45,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:07:45,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:07:45,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:07:45,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:07:45,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:07:45,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:07:45,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:07:45,015 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:07:45,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:07:45,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:07:45,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:07:45,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:07:45,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:07:45,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:07:45,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:07:45,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:07:45,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:07:45,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:07:45,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:07:45,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:07:45,019 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 -> 6060f0df556deb332d160eff8a39bcf699b67887fb6a475da5cd3837f5257af8 [2022-02-20 14:07:45,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:07:45,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:07:45,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:07:45,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:07:45,310 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:07:45,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_sentinel.i.v+cfa-reducer.c [2022-02-20 14:07:45,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96851d8d4/9a56b7e04c4f4b7095f79a86c47cd562/FLAG79cfc43c4 [2022-02-20 14:07:45,714 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:07:45,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel.i.v+cfa-reducer.c [2022-02-20 14:07:45,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96851d8d4/9a56b7e04c4f4b7095f79a86c47cd562/FLAG79cfc43c4 [2022-02-20 14:07:45,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96851d8d4/9a56b7e04c4f4b7095f79a86c47cd562 [2022-02-20 14:07:45,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:07:45,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:07:45,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:07:45,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:07:45,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:07:45,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f25d72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45, skipping insertion in model container [2022-02-20 14:07:45,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:07:45,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:07:45,881 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_sentinel.i.v+cfa-reducer.c[991,1004] [2022-02-20 14:07:45,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:07:45,891 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:07:45,903 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_sentinel.i.v+cfa-reducer.c[991,1004] [2022-02-20 14:07:45,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:07:45,919 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:07:45,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45 WrapperNode [2022-02-20 14:07:45,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:07:45,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:07:45,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:07:45,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:07:45,926 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:07:45" (1/1) ... [2022-02-20 14:07:45,930 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:07:45" (1/1) ... [2022-02-20 14:07:45,957 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-02-20 14:07:45,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:07:45,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:07:45,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:07:45,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:07:45,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:45,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:07:45,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:07:45,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:07:45,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:07:45,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (1/1) ... [2022-02-20 14:07:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:07:46,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:46,025 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:07:46,030 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:07:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:07:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:07:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:07:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:07:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:07:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:07:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:07:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:07:46,122 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:07:46,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:07:46,312 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:07:46,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:07:46,323 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:07:46,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:07:46 BoogieIcfgContainer [2022-02-20 14:07:46,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:07:46,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:07:46,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:07:46,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:07:46,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:07:45" (1/3) ... [2022-02-20 14:07:46,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596786cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:07:46, skipping insertion in model container [2022-02-20 14:07:46,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:07:45" (2/3) ... [2022-02-20 14:07:46,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596786cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:07:46, skipping insertion in model container [2022-02-20 14:07:46,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:07:46" (3/3) ... [2022-02-20 14:07:46,351 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2022-02-20 14:07:46,355 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:07:46,356 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:07:46,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:07:46,409 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:07:46,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:07:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:07:46,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:46,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:46,436 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1960333522, now seen corresponding path program 1 times [2022-02-20 14:07:46,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:46,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986480915] [2022-02-20 14:07:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:46,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {17#true} is VALID [2022-02-20 14:07:46,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {19#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:46,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {18#false} is VALID [2022-02-20 14:07:46,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} assume main_~main__pos~0#1 >= 0; {18#false} is VALID [2022-02-20 14:07:46,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {18#false} is VALID [2022-02-20 14:07:46,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {18#false} is VALID [2022-02-20 14:07:46,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {18#false} is VALID [2022-02-20 14:07:46,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {18#false} is VALID [2022-02-20 14:07:46,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 14:07:46,612 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:07:46,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:46,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986480915] [2022-02-20 14:07:46,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986480915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:07:46,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:07:46,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:07:46,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083858919] [2022-02-20 14:07:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:07:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:07:46,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:46,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:46,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:07:46,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:07:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:07:46,668 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:46,722 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2022-02-20 14:07:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:07:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:07:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 14:07:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 14:07:46,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-20 14:07:46,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:46,781 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:07:46,782 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 14:07:46,784 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:07:46,830 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 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:07:46,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:07:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 14:07:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-20 14:07:46,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:46,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,860 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,861 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:46,865 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-20 14:07:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-20 14:07:46,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:46,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:46,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-20 14:07:46,867 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-20 14:07:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:46,877 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-20 14:07:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-20 14:07:46,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:46,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:46,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:46,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-20 14:07:46,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-02-20 14:07:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:46,881 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-20 14:07:46,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 14:07:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:07:46,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:46,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:46,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:07:46,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1620761708, now seen corresponding path program 1 times [2022-02-20 14:07:46,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:46,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757850584] [2022-02-20 14:07:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:46,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {95#true} is VALID [2022-02-20 14:07:46,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {97#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:46,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {97#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {97#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:46,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {97#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {98#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:46,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {96#false} is VALID [2022-02-20 14:07:46,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume main_~main__pos~0#1 >= 0; {96#false} is VALID [2022-02-20 14:07:46,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {96#false} is VALID [2022-02-20 14:07:46,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {96#false} is VALID [2022-02-20 14:07:46,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {96#false} is VALID [2022-02-20 14:07:46,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {96#false} is VALID [2022-02-20 14:07:46,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} assume !false; {96#false} is VALID [2022-02-20 14:07:46,971 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:07:46,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:46,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757850584] [2022-02-20 14:07:46,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757850584] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:46,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557051481] [2022-02-20 14:07:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:46,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:46,975 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:07:46,976 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:07:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:07:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:47,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {95#true} is VALID [2022-02-20 14:07:47,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {105#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:47,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {105#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:47,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {98#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:47,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {96#false} is VALID [2022-02-20 14:07:47,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume main_~main__pos~0#1 >= 0; {96#false} is VALID [2022-02-20 14:07:47,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {96#false} is VALID [2022-02-20 14:07:47,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {96#false} is VALID [2022-02-20 14:07:47,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {96#false} is VALID [2022-02-20 14:07:47,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {96#false} is VALID [2022-02-20 14:07:47,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} assume !false; {96#false} is VALID [2022-02-20 14:07:47,110 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:07:47,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:47,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} assume !false; {96#false} is VALID [2022-02-20 14:07:47,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {96#false} is VALID [2022-02-20 14:07:47,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {96#false} is VALID [2022-02-20 14:07:47,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {96#false} is VALID [2022-02-20 14:07:47,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {96#false} is VALID [2022-02-20 14:07:47,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume main_~main__pos~0#1 >= 0; {96#false} is VALID [2022-02-20 14:07:47,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {96#false} is VALID [2022-02-20 14:07:47,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {151#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:07:47,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {155#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:47,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {155#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:47,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {95#true} is VALID [2022-02-20 14:07:47,165 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:07:47,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557051481] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:47,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:47,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:07:47,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807157944] [2022-02-20 14:07:47,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 11 [2022-02-20 14:07:47,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:47,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:07:47,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:47,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:07:47,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:07:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:07:47,184 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:07:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,225 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 14:07:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:07:47,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 11 [2022-02-20 14:07:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:07:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 14:07:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:07:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 14:07:47,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-02-20 14:07:47,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:47,254 INFO L225 Difference]: With dead ends: 25 [2022-02-20 14:07:47,255 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:07:47,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:07:47,257 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 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:07:47,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:07:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:07:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:07:47,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:47,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:47,264 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:47,264 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,266 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:07:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:07:47,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:47,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:47,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:07:47,267 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:07:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,270 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:07:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:07:47,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:47,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:47,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:47,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 14:07:47,274 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 11 [2022-02-20 14:07:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:47,274 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 14:07:47,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:07:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:07:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:07:47,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:47,277 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:47,297 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:07:47,491 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:07:47,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 47568678, now seen corresponding path program 2 times [2022-02-20 14:07:47,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:47,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965098569] [2022-02-20 14:07:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {256#true} is VALID [2022-02-20 14:07:47,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {256#true} is VALID [2022-02-20 14:07:47,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {256#true} is VALID [2022-02-20 14:07:47,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {256#true} is VALID [2022-02-20 14:07:47,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {256#true} is VALID [2022-02-20 14:07:47,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {256#true} is VALID [2022-02-20 14:07:47,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {256#true} is VALID [2022-02-20 14:07:47,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {256#true} is VALID [2022-02-20 14:07:47,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {256#true} is VALID [2022-02-20 14:07:47,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {256#true} is VALID [2022-02-20 14:07:47,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {256#true} assume !(main_~i~0#1 < 100000); {256#true} is VALID [2022-02-20 14:07:47,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} assume main_~main__pos~0#1 >= 0; {258#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:47,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {259#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:47,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {259#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:47,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {260#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 14:07:47,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {260#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {257#false} is VALID [2022-02-20 14:07:47,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-02-20 14:07:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:07:47,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:47,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965098569] [2022-02-20 14:07:47,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965098569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:07:47,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:07:47,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:07:47,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556141240] [2022-02-20 14:07:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:07:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:47,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:47,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:07:47,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:47,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:07:47,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:07:47,634 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,703 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 14:07:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:07:47,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-20 14:07:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-20 14:07:47,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2022-02-20 14:07:47,718 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:07:47,719 INFO L225 Difference]: With dead ends: 23 [2022-02-20 14:07:47,720 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:07:47,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:07:47,722 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:47,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:07:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:07:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:07:47,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:47,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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:07:47,734 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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:07:47,734 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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:07:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,735 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 14:07:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:07:47,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:47,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:47,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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 20 states. [2022-02-20 14:07:47,737 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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 20 states. [2022-02-20 14:07:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:47,738 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 14:07:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:07:47,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:47,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:47,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:47,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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:07:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 14:07:47,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2022-02-20 14:07:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:47,741 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 14:07:47,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:07:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 14:07:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:07:47,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:47,743 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:47,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:07:47,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1533228919, now seen corresponding path program 1 times [2022-02-20 14:07:47,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:47,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362205716] [2022-02-20 14:07:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {364#true} is VALID [2022-02-20 14:07:47,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {366#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:47,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {366#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:47,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {366#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:47,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:47,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:47,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:47,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:47,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:47,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {370#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:47,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {365#false} is VALID [2022-02-20 14:07:47,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} assume main_~main__pos~0#1 >= 0; {365#false} is VALID [2022-02-20 14:07:47,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {365#false} is VALID [2022-02-20 14:07:47,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:47,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {365#false} is VALID [2022-02-20 14:07:47,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:47,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {365#false} is VALID [2022-02-20 14:07:47,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {365#false} is VALID [2022-02-20 14:07:47,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 14:07:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:47,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:47,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362205716] [2022-02-20 14:07:47,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362205716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:47,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702583695] [2022-02-20 14:07:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:47,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:47,845 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:07:47,846 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:07:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:07:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:47,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:48,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {364#true} is VALID [2022-02-20 14:07:48,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {377#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:48,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {377#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:48,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:48,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:48,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:48,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:48,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:48,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:48,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {370#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:48,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {365#false} is VALID [2022-02-20 14:07:48,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} assume main_~main__pos~0#1 >= 0; {365#false} is VALID [2022-02-20 14:07:48,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {365#false} is VALID [2022-02-20 14:07:48,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:48,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {365#false} is VALID [2022-02-20 14:07:48,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:48,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {365#false} is VALID [2022-02-20 14:07:48,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {365#false} is VALID [2022-02-20 14:07:48,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 14:07:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:48,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:48,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 14:07:48,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {365#false} is VALID [2022-02-20 14:07:48,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {365#false} is VALID [2022-02-20 14:07:48,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:48,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {365#false} is VALID [2022-02-20 14:07:48,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {365#false} is VALID [2022-02-20 14:07:48,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {365#false} is VALID [2022-02-20 14:07:48,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} assume main_~main__pos~0#1 >= 0; {365#false} is VALID [2022-02-20 14:07:48,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {453#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {365#false} is VALID [2022-02-20 14:07:48,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {453#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:07:48,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {457#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:48,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {457#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:48,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {464#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:48,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {464#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:48,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {471#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:48,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {478#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {471#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:48,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {478#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:48,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {478#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:48,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {364#true} is VALID [2022-02-20 14:07:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:48,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702583695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:48,179 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:48,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:07:48,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261591356] [2022-02-20 14:07:48,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:07:48,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:48,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:48,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:48,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:07:48,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:07:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:07:48,213 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:48,328 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 14:07:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:07:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:07:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-02-20 14:07:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-02-20 14:07:48,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-02-20 14:07:48,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:48,366 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:07:48,367 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:07:48,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:07:48,367 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:48,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:07:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:07:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 14:07:48,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:48,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,379 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,379 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:48,380 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 14:07:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:07:48,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:48,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:48,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,380 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:48,381 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 14:07:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:07:48,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:48,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:48,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:48,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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:07:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-20 14:07:48,382 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 19 [2022-02-20 14:07:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:48,382 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-20 14:07:48,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:07:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:07:48,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:48,383 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:48,401 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:07:48,583 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,SelfDestructingSolverStorable3 [2022-02-20 14:07:48,583 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1092675971, now seen corresponding path program 2 times [2022-02-20 14:07:48,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:48,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115199068] [2022-02-20 14:07:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:48,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {652#true} is VALID [2022-02-20 14:07:48,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {654#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:48,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {654#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:48,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {654#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:48,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:48,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:48,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:48,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:48,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:48,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:48,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:48,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:48,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:48,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:48,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:48,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:48,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:48,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:48,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:48,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:48,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:48,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {664#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#false} assume main_~main__pos~0#1 >= 0; {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {653#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {653#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {653#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {653#false} is VALID [2022-02-20 14:07:48,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {653#false} assume !false; {653#false} is VALID [2022-02-20 14:07:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:48,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:48,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115199068] [2022-02-20 14:07:48,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115199068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:48,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40455870] [2022-02-20 14:07:48,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:07:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:48,828 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:07:48,829 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:07:48,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:07:48,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:07:48,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:07:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:48,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:49,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {652#true} is VALID [2022-02-20 14:07:49,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {671#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:49,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {671#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:49,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {671#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:49,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:49,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:49,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:49,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:49,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:49,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:49,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:49,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:49,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:49,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:49,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:49,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:49,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:49,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {661#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:49,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:49,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {662#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:49,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:49,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {664#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:49,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#false} assume main_~main__pos~0#1 >= 0; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {653#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {653#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {653#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {653#false} assume !false; {653#false} is VALID [2022-02-20 14:07:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:49,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:49,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {653#false} assume !false; {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {653#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {653#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {653#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {653#false} is VALID [2022-02-20 14:07:49,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#false} assume main_~main__pos~0#1 >= 0; {653#false} is VALID [2022-02-20 14:07:49,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {653#false} is VALID [2022-02-20 14:07:49,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {787#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {783#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:07:49,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {787#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {787#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:49,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {794#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {787#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:49,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {794#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {794#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:49,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {801#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {794#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:49,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {801#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:49,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {801#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:49,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {808#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:49,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {815#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {808#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:49,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {815#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:07:49,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {815#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:07:49,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {822#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {822#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:07:49,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {822#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:07:49,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {829#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:07:49,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {829#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:07:49,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {836#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:07:49,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {836#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:07:49,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {843#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:07:49,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {843#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:07:49,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {850#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:07:49,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {850#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:07:49,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {652#true} is VALID [2022-02-20 14:07:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:49,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40455870] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:49,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:49,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:07:49,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436192142] [2022-02-20 14:07:49,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:49,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:49,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:07:49,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:07:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:07:49,686 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:49,833 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 14:07:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:07:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2022-02-20 14:07:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2022-02-20 14:07:49,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 74 transitions. [2022-02-20 14:07:49,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:49,890 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:07:49,890 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 14:07:49,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:07:49,891 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:49,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 50 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:07:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 14:07:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 14:07:49,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:49,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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:07:49,910 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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:07:49,911 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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:07:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:49,912 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-02-20 14:07:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:07:49,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:49,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:49,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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 56 states. [2022-02-20 14:07:49,913 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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 56 states. [2022-02-20 14:07:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:49,914 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-02-20 14:07:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:07:49,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:49,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:49,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:49,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 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:07:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-02-20 14:07:49,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 31 [2022-02-20 14:07:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:49,917 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-02-20 14:07:49,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 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:07:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-02-20 14:07:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 14:07:49,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:49,918 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:49,935 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:07:50,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:50,135 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1116944283, now seen corresponding path program 3 times [2022-02-20 14:07:50,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:50,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145346179] [2022-02-20 14:07:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:50,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1144#true} is VALID [2022-02-20 14:07:50,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {1146#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:50,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1146#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:50,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {1146#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1147#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:50,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {1147#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1147#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:50,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1147#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1148#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:50,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {1148#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1148#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:50,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {1148#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1149#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:50,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1149#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:50,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1149#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1150#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:50,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1150#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:50,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1151#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:50,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {1151#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1151#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:50,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {1151#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1152#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:50,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1152#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:50,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1153#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:50,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1153#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1153#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:50,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {1153#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1154#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:50,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1154#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:50,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1155#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:50,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1155#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:50,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1155#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1156#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:50,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1156#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:50,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1157#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:50,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1157#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:50,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1158#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:50,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1158#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:50,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1159#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:50,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1159#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:50,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1160#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:50,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1160#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:50,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1161#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:50,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1161#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:50,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1162#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:50,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1162#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:50,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1163#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:50,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1163#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:50,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1164#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:50,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1164#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:50,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1165#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:50,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {1165#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1165#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:50,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {1165#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1166#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:50,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {1166#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1166#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:50,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {1166#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1167#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:50,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {1167#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1167#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:50,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {1167#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1168#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:50,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {1168#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1145#false} is VALID [2022-02-20 14:07:50,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {1145#false} assume main_~main__pos~0#1 >= 0; {1145#false} is VALID [2022-02-20 14:07:50,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {1145#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {1145#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {1145#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {1145#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {1145#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {1145#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1145#false} is VALID [2022-02-20 14:07:50,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 14:07:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:07:50,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:50,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145346179] [2022-02-20 14:07:50,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145346179] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:50,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556296181] [2022-02-20 14:07:50,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:07:50,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:50,522 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:07:50,524 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:07:50,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 14:07:50,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:07:50,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:07:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:50,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 14:07:50,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:07:50,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-02-20 14:07:51,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1144#true} is VALID [2022-02-20 14:07:51,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {1144#true} is VALID [2022-02-20 14:07:51,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {1144#true} assume !(main_~i~0#1 < 100000); {1144#true} is VALID [2022-02-20 14:07:51,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {1144#true} assume main_~main__pos~0#1 >= 0; {1313#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:51,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {1313#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1317#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#main__a~0#1.base|) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__pos~0#1| 4))) |ULTIMATE.start_main_~main__marker~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 0) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|))} is VALID [2022-02-20 14:07:51,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {1317#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#main__a~0#1.base|) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__pos~0#1| 4))) |ULTIMATE.start_main_~main__marker~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 0) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|))} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1321#(and (or (exists ((|ULTIMATE.start_main_~#main__a~0#1.offset| Int)) (not (= (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__i~0#1| 4)) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__pos~0#1| 4))))) (= |ULTIMATE.start_main_#t~mem8#1| |ULTIMATE.start_main_~main__marker~0#1|)) (<= |ULTIMATE.start_main_~main__i~0#1| 0) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|))} is VALID [2022-02-20 14:07:51,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {1321#(and (or (exists ((|ULTIMATE.start_main_~#main__a~0#1.offset| Int)) (not (= (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__i~0#1| 4)) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__pos~0#1| 4))))) (= |ULTIMATE.start_main_#t~mem8#1| |ULTIMATE.start_main_~main__marker~0#1|)) (<= |ULTIMATE.start_main_~main__i~0#1| 0) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|))} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1325#(and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|) (< |ULTIMATE.start_main_~main__i~0#1| (+ |ULTIMATE.start_main_~main__pos~0#1| 1)))} is VALID [2022-02-20 14:07:51,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {1325#(and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|) (< |ULTIMATE.start_main_~main__i~0#1| (+ |ULTIMATE.start_main_~main__pos~0#1| 1)))} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1325#(and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|) (< |ULTIMATE.start_main_~main__i~0#1| (+ |ULTIMATE.start_main_~main__pos~0#1| 1)))} is VALID [2022-02-20 14:07:51,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {1325#(and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__pos~0#1|) (< |ULTIMATE.start_main_~main__i~0#1| (+ |ULTIMATE.start_main_~main__pos~0#1| 1)))} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1332#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 14:07:51,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {1332#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1145#false} is VALID [2022-02-20 14:07:51,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 14:07:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-02-20 14:07:51,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:51,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-20 14:07:51,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-02-20 14:07:51,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 14:07:51,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {1332#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1145#false} is VALID [2022-02-20 14:07:51,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {1345#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1332#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 14:07:51,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {1345#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1345#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:51,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {1352#(or (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__pos~0#1|) (= |ULTIMATE.start_main_#t~mem8#1| |ULTIMATE.start_main_~main__marker~0#1|))} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1345#(<= |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:51,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {1356#(or (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__pos~0#1|) (= |ULTIMATE.start_main_~main__marker~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#main__a~0#1.base|) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__i~0#1| 4)))))} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1352#(or (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__pos~0#1|) (= |ULTIMATE.start_main_#t~mem8#1| |ULTIMATE.start_main_~main__marker~0#1|))} is VALID [2022-02-20 14:07:51,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {1313#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1356#(or (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__pos~0#1|) (= |ULTIMATE.start_main_~main__marker~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#main__a~0#1.base|) (+ |ULTIMATE.start_main_~#main__a~0#1.offset| (* |ULTIMATE.start_main_~main__i~0#1| 4)))))} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {1144#true} assume main_~main__pos~0#1 >= 0; {1313#(<= 0 |ULTIMATE.start_main_~main__pos~0#1|)} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {1144#true} assume !(main_~i~0#1 < 100000); {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1144#true} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {1144#true} is VALID [2022-02-20 14:07:51,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1144#true} is VALID [2022-02-20 14:07:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-02-20 14:07:51,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556296181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:51,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:51,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7, 7] total 33 [2022-02-20 14:07:51,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962074818] [2022-02-20 14:07:51,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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 55 [2022-02-20 14:07:51,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:51,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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:07:51,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:51,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-20 14:07:51,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-20 14:07:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=730, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 14:07:51,656 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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:07:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:51,856 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-02-20 14:07:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 14:07:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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 55 [2022-02-20 14:07:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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:07:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-02-20 14:07:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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:07:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-02-20 14:07:51,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-02-20 14:07:51,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:51,912 INFO L225 Difference]: With dead ends: 71 [2022-02-20 14:07:51,912 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 14:07:51,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 14:07:51,913 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:51,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-02-20 14:07:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 14:07:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-02-20 14:07:51,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:51,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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:07:51,941 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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:07:51,941 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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:07:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:51,942 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-02-20 14:07:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-02-20 14:07:51,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:51,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:51,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 states. [2022-02-20 14:07:51,943 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 states. [2022-02-20 14:07:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:51,944 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-02-20 14:07:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-02-20 14:07:51,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:51,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:51,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:51,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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:07:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-02-20 14:07:51,946 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 55 [2022-02-20 14:07:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:51,946 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-02-20 14:07:51,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 states have internal predecessors, (70), 0 states have call successors, (0), 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:07:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-20 14:07:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 14:07:51,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:51,947 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:51,967 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:07:52,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:52,148 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash 739565382, now seen corresponding path program 4 times [2022-02-20 14:07:52,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:52,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399590315] [2022-02-20 14:07:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:52,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {1816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1816#true} is VALID [2022-02-20 14:07:52,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {1818#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:52,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1818#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:52,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {1818#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:52,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:52,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:52,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:52,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:52,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:52,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:52,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:52,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:52,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:52,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:52,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:52,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:52,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:52,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:52,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:52,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:52,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:52,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:52,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:52,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:52,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:52,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:52,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:52,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:52,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:52,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:52,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:52,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:52,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:52,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:52,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:52,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:52,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:52,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:52,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:52,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:52,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:52,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:52,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:52,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:52,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:52,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:52,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1841#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {1841#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !(main_~i~0#1 < 100000); {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {1817#false} assume main_~main__pos~0#1 >= 0; {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {1817#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:52,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {1817#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1817#false} is VALID [2022-02-20 14:07:52,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {1817#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1817#false} is VALID [2022-02-20 14:07:52,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {1817#false} assume !false; {1817#false} is VALID [2022-02-20 14:07:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:07:52,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:52,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399590315] [2022-02-20 14:07:52,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399590315] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:52,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136838704] [2022-02-20 14:07:52,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:07:52,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:52,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:52,550 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:07:52,551 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:07:52,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:07:52,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:07:52,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:07:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:52,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:52,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {1816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1816#true} is VALID [2022-02-20 14:07:52,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {1848#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:52,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1848#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:52,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {1848#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:52,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:52,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {1819#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:52,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:52,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1820#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:52,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:52,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {1821#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:53,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:53,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1822#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:53,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:53,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:53,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:53,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:53,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:53,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {1825#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:53,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:53,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {1826#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:53,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:53,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {1827#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:53,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:53,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:53,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:53,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {1829#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:53,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:53,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {1830#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:53,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:53,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {1831#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:53,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:53,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {1832#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:53,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:53,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {1833#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:53,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:53,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {1834#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:53,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:53,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {1835#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:53,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:53,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {1836#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:53,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:53,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {1837#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:53,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:53,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {1838#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:53,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:53,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {1839#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:53,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:53,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {1840#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1841#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:07:53,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {1841#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !(main_~i~0#1 < 100000); {1817#false} is VALID [2022-02-20 14:07:53,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {1817#false} assume main_~main__pos~0#1 >= 0; {1817#false} is VALID [2022-02-20 14:07:53,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {1817#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {1817#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {1817#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1817#false} is VALID [2022-02-20 14:07:53,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {1817#false} assume !false; {1817#false} is VALID [2022-02-20 14:07:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:07:53,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {1817#false} assume !false; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {1817#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {1817#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {1817#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {1817#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {1817#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {1817#false} is VALID [2022-02-20 14:07:53,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {1817#false} assume main_~main__pos~0#1 >= 0; {1817#false} is VALID [2022-02-20 14:07:53,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {2050#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1817#false} is VALID [2022-02-20 14:07:53,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {2054#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2050#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:07:53,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {2054#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2054#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:53,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {2061#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2054#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:07:53,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {2061#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2061#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:53,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {2068#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2061#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:07:53,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {2068#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2068#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:53,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {2075#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2068#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:07:53,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {2075#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2075#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:53,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {2082#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2075#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:07:53,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {2082#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2082#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:07:53,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {2089#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2082#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:07:53,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {2089#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2089#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:07:53,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {2096#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2089#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:07:53,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {2096#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2096#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:07:53,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {2103#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2096#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:07:53,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {2103#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2103#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:07:53,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {2110#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2103#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:07:53,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {2110#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2110#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:07:53,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {2117#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2110#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:07:53,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {2117#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2117#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:07:53,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {2124#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2117#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:07:53,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {2124#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2124#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:07:53,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {2131#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2124#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:07:53,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {2131#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2131#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:07:53,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2131#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:07:53,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2138#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:07:53,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {2145#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2138#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:07:53,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {2145#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2145#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:07:53,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {2152#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2145#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:07:53,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {2152#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2152#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:07:53,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2159#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2152#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:07:53,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {2159#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2159#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:07:53,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {2166#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2159#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:07:53,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {2166#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2166#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:07:53,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {2173#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2166#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:07:53,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {2173#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2173#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:07:53,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {2180#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2173#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:07:53,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {2180#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2180#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:07:53,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {2187#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2180#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:07:53,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {2187#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2187#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:07:53,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {2194#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2187#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:07:53,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {2194#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2194#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:07:53,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {2201#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2194#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:07:53,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {2201#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2201#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:07:53,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {2208#(< |ULTIMATE.start_main_~i~0#1| 99977)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2201#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:07:53,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< |ULTIMATE.start_main_~i~0#1| 99977)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2208#(< |ULTIMATE.start_main_~i~0#1| 99977)} is VALID [2022-02-20 14:07:53,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {2208#(< |ULTIMATE.start_main_~i~0#1| 99977)} is VALID [2022-02-20 14:07:53,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {1816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {1816#true} is VALID [2022-02-20 14:07:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:07:53,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136838704] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:53,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:53,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2022-02-20 14:07:53,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547157756] [2022-02-20 14:07:53,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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 59 [2022-02-20 14:07:53,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:53,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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:07:54,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:54,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-20 14:07:54,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-20 14:07:54,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 14:07:54,080 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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:07:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:54,405 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2022-02-20 14:07:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-20 14:07:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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 59 [2022-02-20 14:07:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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:07:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 139 transitions. [2022-02-20 14:07:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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:07:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 139 transitions. [2022-02-20 14:07:54,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 139 transitions. [2022-02-20 14:07:54,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:54,504 INFO L225 Difference]: With dead ends: 121 [2022-02-20 14:07:54,504 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 14:07:54,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 14:07:54,505 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:54,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 50 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:07:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 14:07:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-20 14:07:54,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:54,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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:07:54,549 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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:07:54,549 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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:07:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:54,551 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-02-20 14:07:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-02-20 14:07:54,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:54,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:54,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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 110 states. [2022-02-20 14:07:54,552 INFO L87 Difference]: Start difference. First operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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 110 states. [2022-02-20 14:07:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:54,555 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-02-20 14:07:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-02-20 14:07:54,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:54,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:54,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:54,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 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:07:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-02-20 14:07:54,558 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 59 [2022-02-20 14:07:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:54,558 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-02-20 14:07:54,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 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:07:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-02-20 14:07:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 14:07:54,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:54,560 INFO L514 BasicCegarLoop]: trace histogram [48, 48, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:54,581 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:07:54,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:54,778 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash -736649004, now seen corresponding path program 5 times [2022-02-20 14:07:54,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:54,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078164416] [2022-02-20 14:07:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:55,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_60~0 := 0; {2775#true} is VALID [2022-02-20 14:07:55,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet7#1, main_#t~post6#1, main_~i~0#1, main_#t~mem8#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__i~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset, main_~main__marker~0#1, main_~main__pos~0#1;call main_~#main__a~0#1.base, main_~#main__a~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~main__marker~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__marker~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main__pos~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__pos~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~i~0#1 := 0; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:55,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:07:55,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2778#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:55,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {2778#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2778#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:07:55,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {2778#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2779#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:55,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2779#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2779#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:07:55,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {2779#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2780#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:55,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2780#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:07:55,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2781#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:55,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2781#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:07:55,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {2781#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2782#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:55,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {2782#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2782#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:07:55,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {2782#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2783#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:55,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {2783#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2783#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:07:55,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {2783#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2784#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:55,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {2784#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2784#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:07:55,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {2784#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2785#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:55,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {2785#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2785#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:07:55,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {2785#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2786#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:55,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2786#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:07:55,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2787#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:55,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {2787#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2787#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:07:55,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {2787#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2788#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:55,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {2788#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2788#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:07:55,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {2788#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2789#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:55,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {2789#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2789#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:07:55,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {2789#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2790#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:55,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {2790#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2790#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:07:55,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {2790#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2791#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:55,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {2791#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2791#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:07:55,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {2791#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2792#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:55,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {2792#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2792#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:07:55,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {2792#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2793#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:55,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {2793#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2793#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:07:55,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {2793#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2794#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:55,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {2794#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2794#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:07:55,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {2794#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2795#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:55,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {2795#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2795#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:07:55,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {2795#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2796#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:55,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {2796#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2796#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:07:55,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {2796#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2797#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:55,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {2797#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2797#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:07:55,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {2797#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2798#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:55,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {2798#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2798#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:07:55,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {2798#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2799#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:55,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {2799#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2799#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:07:55,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {2799#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2800#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:07:55,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2800#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:07:55,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2801#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:07:55,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {2801#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2801#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:07:55,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {2801#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2802#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:07:55,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {2802#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2802#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:07:55,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {2802#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:07:55,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:07:55,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2804#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:07:55,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {2804#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2804#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:07:55,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {2804#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2805#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:07:55,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {2805#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2805#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:07:55,795 INFO L290 TraceCheckUtils]: 59: Hoare triple {2805#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2806#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:07:55,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {2806#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2806#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:07:55,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {2806#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2807#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:07:55,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {2807#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2807#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:07:55,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {2807#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2808#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:07:55,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {2808#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2808#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:07:55,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {2808#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2809#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:07:55,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {2809#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2809#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:07:55,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {2809#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2810#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:07:55,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {2810#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2810#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:07:55,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {2810#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2811#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:07:55,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {2811#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2811#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:07:55,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {2811#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2812#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:07:55,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {2812#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2812#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:07:55,800 INFO L290 TraceCheckUtils]: 73: Hoare triple {2812#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:07:55,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:07:55,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2814#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:07:55,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {2814#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2814#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:07:55,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {2814#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2815#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:07:55,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {2815#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2815#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:07:55,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {2815#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2816#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:07:55,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {2816#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2816#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:07:55,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {2816#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2817#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:07:55,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {2817#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2817#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:07:55,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {2817#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2818#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:07:55,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {2818#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2818#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:07:55,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {2818#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2819#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:07:55,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {2819#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2819#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:07:55,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {2819#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2820#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:07:55,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {2820#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2820#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:07:55,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {2820#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2821#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:07:55,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {2821#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2821#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:07:55,808 INFO L290 TraceCheckUtils]: 91: Hoare triple {2821#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2822#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:07:55,808 INFO L290 TraceCheckUtils]: 92: Hoare triple {2822#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2822#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:07:55,808 INFO L290 TraceCheckUtils]: 93: Hoare triple {2822#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:07:55,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:07:55,809 INFO L290 TraceCheckUtils]: 95: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2824#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-20 14:07:55,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {2824#(<= |ULTIMATE.start_main_~i~0#1| 47)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;call write~int(main_#t~nondet7#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {2824#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-20 14:07:55,810 INFO L290 TraceCheckUtils]: 97: Hoare triple {2824#(<= |ULTIMATE.start_main_~i~0#1| 47)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2825#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 14:07:55,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {2825#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !(main_~i~0#1 < 100000); {2776#false} is VALID [2022-02-20 14:07:55,810 INFO L290 TraceCheckUtils]: 99: Hoare triple {2776#false} assume main_~main__pos~0#1 >= 0; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 100: Hoare triple {2776#false} assume main_~main__pos~0#1 < 100000;call write~int(main_~main__marker~0#1, main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__pos~0#1, 4);main_~main__i~0#1 := 0; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 101: Hoare triple {2776#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 102: Hoare triple {2776#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 103: Hoare triple {2776#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {2776#false} assume main_#t~mem8#1 != main_~main__marker~0#1;havoc main_#t~mem8#1;main_~main__i~0#1 := 1 + main_~main__i~0#1; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {2776#false} call main_#t~mem8#1 := read~int(main_~#main__a~0#1.base, main_~#main__a~0#1.offset + 4 * main_~main__i~0#1, 4); {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {2776#false} assume !(main_#t~mem8#1 != main_~main__marker~0#1);havoc main_#t~mem8#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__i~0#1 <= main_~main__pos~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {2776#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {2776#false} is VALID [2022-02-20 14:07:55,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-02-20 14:07:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2310 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:07:55,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:55,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078164416] [2022-02-20 14:07:55,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078164416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:55,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506616596] [2022-02-20 14:07:55,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:07:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:55,814 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:07:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process