./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c9c46abbea18888bba6501dfe6c704a11e8fe399c985999e1e07c66bb12b728 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:01:14,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:01:14,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:01:14,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:01:14,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:01:14,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:01:14,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:01:14,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:01:14,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:01:14,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:01:14,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:01:14,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:01:14,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:01:14,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:01:14,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:01:14,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:01:14,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:01:14,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:01:14,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:01:14,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:01:14,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:01:14,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:01:14,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:01:14,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:01:14,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:01:14,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:01:14,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:01:14,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:01:14,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:01:14,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:01:14,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:01:14,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:01:14,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:01:14,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:01:14,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:01:14,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:01:14,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:01:14,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:01:14,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:01:14,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:01:14,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:01:14,413 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:01:14,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:01:14,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:01:14,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:01:14,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:01:14,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:01:14,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:01:14,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:01:14,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:01:14,444 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:01:14,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:01:14,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:01:14,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:01:14,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:01:14,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:01:14,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:01:14,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:01:14,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:01:14,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:01:14,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:01:14,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:14,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:01:14,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:01:14,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:01:14,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:01:14,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:01:14,450 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:01:14,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:01:14,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:01:14,451 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 -> 4c9c46abbea18888bba6501dfe6c704a11e8fe399c985999e1e07c66bb12b728 [2022-02-20 14:01:14,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:01:14,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:01:14,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:01:14,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:01:14,710 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:01:14,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i [2022-02-20 14:01:14,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04826fe3/219a72a5a7904178856e61b8a8ce8fbb/FLAG6073f1c7f [2022-02-20 14:01:15,148 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:01:15,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i [2022-02-20 14:01:15,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04826fe3/219a72a5a7904178856e61b8a8ce8fbb/FLAG6073f1c7f [2022-02-20 14:01:15,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04826fe3/219a72a5a7904178856e61b8a8ce8fbb [2022-02-20 14:01:15,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:01:15,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:01:15,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:15,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:01:15,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:01:15,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c2ee32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15, skipping insertion in model container [2022-02-20 14:01:15,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:01:15,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:01:15,718 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/data_structures_set_multi_proc_ground-1.i[832,845] [2022-02-20 14:01:15,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:15,776 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:01:15,790 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/data_structures_set_multi_proc_ground-1.i[832,845] [2022-02-20 14:01:15,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:15,830 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:01:15,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15 WrapperNode [2022-02-20 14:01:15,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:15,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:15,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:01:15,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:01:15,838 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:01:15" (1/1) ... [2022-02-20 14:01:15,851 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:01:15" (1/1) ... [2022-02-20 14:01:15,888 INFO L137 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-02-20 14:01:15,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:15,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:01:15,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:01:15,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:01:15,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:01:15,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:01:15,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:01:15,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:01:15,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:15,964 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:01:16,003 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:01:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:01:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:01:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:01:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:01:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:01:16,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:01:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:01:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 14:01:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 14:01:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:01:16,115 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:01:16,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:01:16,445 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:01:16,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:01:16,457 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 14:01:16,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16 BoogieIcfgContainer [2022-02-20 14:01:16,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:01:16,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:01:16,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:01:16,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:01:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:01:15" (1/3) ... [2022-02-20 14:01:16,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c0fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (2/3) ... [2022-02-20 14:01:16,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c0fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16" (3/3) ... [2022-02-20 14:01:16,468 INFO L111 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-1.i [2022-02-20 14:01:16,473 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:01:16,474 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:01:16,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:01:16,534 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:01:16,535 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:01:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:01:16,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:16,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:16,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1976888394, now seen corresponding path program 1 times [2022-02-20 14:01:16,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:16,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413080012] [2022-02-20 14:01:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:16,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#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(42, 2); {44#true} is VALID [2022-02-20 14:01:16,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {46#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:16,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 100000); {45#false} is VALID [2022-02-20 14:01:16,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#false} main_~x~0#1 := 0; {45#false} is VALID [2022-02-20 14:01:16,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {45#false} is VALID [2022-02-20 14:01:16,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {45#false} is VALID [2022-02-20 14:01:16,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {45#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {45#false} is VALID [2022-02-20 14:01:16,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2022-02-20 14:01:16,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID [2022-02-20 14:01:16,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {45#false} assume !false; {45#false} is VALID [2022-02-20 14:01:16,800 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:01:16,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:16,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413080012] [2022-02-20 14:01:16,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413080012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:16,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:16,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:16,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766929986] [2022-02-20 14:01:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:16,814 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:16,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:16,817 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:16,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:16,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:16,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:16,857 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,068 INFO L93 Difference]: Finished difference Result 110 states and 169 transitions. [2022-02-20 14:01:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:17,069 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:17,070 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 14:01:17,083 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 14:01:17,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 169 transitions. [2022-02-20 14:01:17,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,281 INFO L225 Difference]: With dead ends: 110 [2022-02-20 14:01:17,282 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 14:01:17,285 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:01:17,290 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:17,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 82 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 14:01:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-02-20 14:01:17,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:17,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,325 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,326 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,334 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-02-20 14:01:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-02-20 14:01:17,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 14:01:17,339 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 14:01:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,344 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-02-20 14:01:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-02-20 14:01:17,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:17,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-02-20 14:01:17,355 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 10 [2022-02-20 14:01:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:17,355 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-02-20 14:01:17,356 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 14:01:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:01:17,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:17,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:17,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:01:17,362 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1321690828, now seen corresponding path program 1 times [2022-02-20 14:01:17,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:17,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67142941] [2022-02-20 14:01:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#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(42, 2); {381#true} is VALID [2022-02-20 14:01:17,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {383#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {383#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {383#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {384#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:17,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {382#false} is VALID [2022-02-20 14:01:17,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#false} main_~x~0#1 := 0; {382#false} is VALID [2022-02-20 14:01:17,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {382#false} is VALID [2022-02-20 14:01:17,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {382#false} is VALID [2022-02-20 14:01:17,455 INFO L272 TraceCheckUtils]: 8: Hoare triple {382#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {382#false} is VALID [2022-02-20 14:01:17,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2022-02-20 14:01:17,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2022-02-20 14:01:17,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#false} assume !false; {382#false} is VALID [2022-02-20 14:01:17,456 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:01:17,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:17,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67142941] [2022-02-20 14:01:17,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67142941] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:17,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748237739] [2022-02-20 14:01:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:17,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:17,471 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:01:17,490 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:01:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:01:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:17,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#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(42, 2); {381#true} is VALID [2022-02-20 14:01:17,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {391#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {391#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {391#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {384#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:17,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {382#false} is VALID [2022-02-20 14:01:17,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#false} main_~x~0#1 := 0; {382#false} is VALID [2022-02-20 14:01:17,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {382#false} is VALID [2022-02-20 14:01:17,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {382#false} is VALID [2022-02-20 14:01:17,701 INFO L272 TraceCheckUtils]: 8: Hoare triple {382#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {382#false} is VALID [2022-02-20 14:01:17,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2022-02-20 14:01:17,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2022-02-20 14:01:17,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#false} assume !false; {382#false} is VALID [2022-02-20 14:01:17,702 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:01:17,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:17,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#false} assume !false; {382#false} is VALID [2022-02-20 14:01:17,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2022-02-20 14:01:17,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2022-02-20 14:01:17,775 INFO L272 TraceCheckUtils]: 8: Hoare triple {382#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {382#false} is VALID [2022-02-20 14:01:17,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {382#false} is VALID [2022-02-20 14:01:17,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {382#false} is VALID [2022-02-20 14:01:17,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#false} main_~x~0#1 := 0; {382#false} is VALID [2022-02-20 14:01:17,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {443#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {382#false} is VALID [2022-02-20 14:01:17,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {447#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {443#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:17,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {447#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {447#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:17,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {447#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:17,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#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(42, 2); {381#true} is VALID [2022-02-20 14:01:17,779 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:01:17,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748237739] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:17,779 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:17,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:01:17,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546288253] [2022-02-20 14:01:17,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:17,781 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:17,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:17,782 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:01:17,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:17,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:01:17,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:01:17,798 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,175 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2022-02-20 14:01:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:01:18,175 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:18,176 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 14:01:18,181 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 14:01:18,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 243 transitions. [2022-02-20 14:01:18,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:18,463 INFO L225 Difference]: With dead ends: 181 [2022-02-20 14:01:18,464 INFO L226 Difference]: Without dead ends: 148 [2022-02-20 14:01:18,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:01:18,466 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 178 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:18,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-20 14:01:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 44. [2022-02-20 14:01:18,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:18,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:18,484 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:18,484 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,496 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2022-02-20 14:01:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2022-02-20 14:01:18,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:18,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:18,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 148 states. [2022-02-20 14:01:18,502 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 148 states. [2022-02-20 14:01:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,508 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2022-02-20 14:01:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2022-02-20 14:01:18,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:18,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:18,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:18,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-02-20 14:01:18,512 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 12 [2022-02-20 14:01:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:18,512 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-02-20 14:01:18,512 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-20 14:01:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:01:18,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:18,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:18,539 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:01:18,737 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:01:18,738 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -202652846, now seen corresponding path program 2 times [2022-02-20 14:01:18,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:18,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892903677] [2022-02-20 14:01:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:18,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {1067#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(42, 2); {1067#true} is VALID [2022-02-20 14:01:18,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~x~0#1 < 100000); {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:18,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(= |ULTIMATE.start_main_~n~0#1| 0)} main_~x~0#1 := 0; {1070#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 14:01:18,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {1070#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1068#false} is VALID [2022-02-20 14:01:18,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1068#false} is VALID [2022-02-20 14:01:18,833 INFO L272 TraceCheckUtils]: 14: Hoare triple {1068#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {1068#false} is VALID [2022-02-20 14:01:18,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1068#false} ~cond := #in~cond; {1068#false} is VALID [2022-02-20 14:01:18,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#false} assume 0 == ~cond; {1068#false} is VALID [2022-02-20 14:01:18,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2022-02-20 14:01:18,834 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:01:18,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:18,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892903677] [2022-02-20 14:01:18,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892903677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:18,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:18,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:01:18,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788022167] [2022-02-20 14:01:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:18,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:01:18,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:18,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:18,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:01:18,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:01:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:18,848 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,936 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2022-02-20 14:01:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:01:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-02-20 14:01:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-02-20 14:01:18,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-02-20 14:01:19,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,022 INFO L225 Difference]: With dead ends: 82 [2022-02-20 14:01:19,022 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:01:19,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:19,027 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:19,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:01:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-02-20 14:01:19,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:19,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,034 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,034 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,036 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-20 14:01:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 14:01:19,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-02-20 14:01:19,037 INFO L87 Difference]: Start difference. First operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-02-20 14:01:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,039 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-20 14:01:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 14:01:19,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:19,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-02-20 14:01:19,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 18 [2022-02-20 14:01:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:19,041 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-02-20 14:01:19,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 14:01:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:01:19,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:19,043 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:19,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:01:19,043 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1069304186, now seen corresponding path program 1 times [2022-02-20 14:01:19,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:19,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639718255] [2022-02-20 14:01:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {1348#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(42, 2); {1348#true} is VALID [2022-02-20 14:01:19,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1348#true} is VALID [2022-02-20 14:01:19,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1348#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1348#true} is VALID [2022-02-20 14:01:19,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {1348#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1348#true} is VALID [2022-02-20 14:01:19,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {1348#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1348#true} is VALID [2022-02-20 14:01:19,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {1348#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1348#true} is VALID [2022-02-20 14:01:19,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1348#true} is VALID [2022-02-20 14:01:19,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1348#true} is VALID [2022-02-20 14:01:19,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1348#true} is VALID [2022-02-20 14:01:19,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1348#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1348#true} is VALID [2022-02-20 14:01:19,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {1348#true} assume !(main_~x~0#1 < 100000); {1348#true} is VALID [2022-02-20 14:01:19,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#true} main_~x~0#1 := 0; {1348#true} is VALID [2022-02-20 14:01:19,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#true} assume !(main_~x~0#1 < main_~n~0#1); {1348#true} is VALID [2022-02-20 14:01:19,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {1348#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {1350#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:19,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {1350#(= |ULTIMATE.start_main_~v~0#1| 0)} assume !(main_~v~0#1 < 100000); {1349#false} is VALID [2022-02-20 14:01:19,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {1349#false} main_~v~0#1 := 0; {1349#false} is VALID [2022-02-20 14:01:19,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {1349#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {1349#false} is VALID [2022-02-20 14:01:19,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {1349#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {1349#false} is VALID [2022-02-20 14:01:19,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {1349#false} elem_exists_#res#1 := 0; {1349#false} is VALID [2022-02-20 14:01:19,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1349#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {1349#false} is VALID [2022-02-20 14:01:19,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1349#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {1349#false} is VALID [2022-02-20 14:01:19,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {1349#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {1349#false} is VALID [2022-02-20 14:01:19,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {1349#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1349#false} is VALID [2022-02-20 14:01:19,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {1349#false} assume !(main_~v~0#1 < 100000); {1349#false} is VALID [2022-02-20 14:01:19,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {1349#false} main_~x~0#1 := 0; {1349#false} is VALID [2022-02-20 14:01:19,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {1349#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1349#false} is VALID [2022-02-20 14:01:19,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {1349#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1349#false} is VALID [2022-02-20 14:01:19,134 INFO L272 TraceCheckUtils]: 27: Hoare triple {1349#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {1349#false} is VALID [2022-02-20 14:01:19,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {1349#false} ~cond := #in~cond; {1349#false} is VALID [2022-02-20 14:01:19,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {1349#false} assume 0 == ~cond; {1349#false} is VALID [2022-02-20 14:01:19,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {1349#false} assume !false; {1349#false} is VALID [2022-02-20 14:01:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 14:01:19,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:19,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639718255] [2022-02-20 14:01:19,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639718255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:19,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:19,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:19,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996936764] [2022-02-20 14:01:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:19,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:19,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:19,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:19,159 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,219 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-02-20 14:01:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 14:01:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 14:01:19,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-02-20 14:01:19,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,285 INFO L225 Difference]: With dead ends: 90 [2022-02-20 14:01:19,285 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 14:01:19,285 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:01:19,286 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:19,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 63 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 14:01:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-02-20 14:01:19,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:19,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,294 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,295 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,296 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-20 14:01:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 14:01:19,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-02-20 14:01:19,297 INFO L87 Difference]: Start difference. First operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-02-20 14:01:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,299 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-20 14:01:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 14:01:19,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:19,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-02-20 14:01:19,301 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2022-02-20 14:01:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:19,301 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-02-20 14:01:19,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 14:01:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:01:19,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:19,302 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:19,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:01:19,303 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:19,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1327947132, now seen corresponding path program 1 times [2022-02-20 14:01:19,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:19,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251780072] [2022-02-20 14:01:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#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(42, 2); {1662#true} is VALID [2022-02-20 14:01:19,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1662#true} is VALID [2022-02-20 14:01:19,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1662#true} is VALID [2022-02-20 14:01:19,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1662#true} is VALID [2022-02-20 14:01:19,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {1662#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1662#true} is VALID [2022-02-20 14:01:19,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1662#true} is VALID [2022-02-20 14:01:19,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {1662#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1662#true} is VALID [2022-02-20 14:01:19,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1662#true} is VALID [2022-02-20 14:01:19,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1662#true} is VALID [2022-02-20 14:01:19,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1662#true} is VALID [2022-02-20 14:01:19,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {1662#true} assume !(main_~x~0#1 < 100000); {1662#true} is VALID [2022-02-20 14:01:19,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1662#true} main_~x~0#1 := 0; {1662#true} is VALID [2022-02-20 14:01:19,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#true} assume !(main_~x~0#1 < main_~n~0#1); {1662#true} is VALID [2022-02-20 14:01:19,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {1664#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:19,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {1664#(= |ULTIMATE.start_main_~v~0#1| 0)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {1664#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:19,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#(= |ULTIMATE.start_main_~v~0#1| 0)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1665#(<= |ULTIMATE.start_main_~v~0#1| 1)} is VALID [2022-02-20 14:01:19,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {1665#(<= |ULTIMATE.start_main_~v~0#1| 1)} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#false} main_~v~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1663#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {1663#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {1663#false} is VALID [2022-02-20 14:01:19,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {1663#false} elem_exists_#res#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {1663#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {1663#false} is VALID [2022-02-20 14:01:19,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {1663#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {1663#false} is VALID [2022-02-20 14:01:19,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {1663#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {1663#false} is VALID [2022-02-20 14:01:19,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {1663#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1663#false} is VALID [2022-02-20 14:01:19,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {1663#false} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {1663#false} main_~x~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {1663#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1663#false} is VALID [2022-02-20 14:01:19,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {1663#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1663#false} is VALID [2022-02-20 14:01:19,424 INFO L272 TraceCheckUtils]: 29: Hoare triple {1663#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {1663#false} is VALID [2022-02-20 14:01:19,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#false} ~cond := #in~cond; {1663#false} is VALID [2022-02-20 14:01:19,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#false} assume 0 == ~cond; {1663#false} is VALID [2022-02-20 14:01:19,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#false} assume !false; {1663#false} is VALID [2022-02-20 14:01:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 14:01:19,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:19,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251780072] [2022-02-20 14:01:19,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251780072] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:19,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192984460] [2022-02-20 14:01:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:19,432 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:01:19,459 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:01:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:01:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:19,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#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(42, 2); {1662#true} is VALID [2022-02-20 14:01:19,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1672#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:19,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {1672#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1672#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:19,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {1672#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1679#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:19,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {1679#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1679#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:19,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1679#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1686#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:19,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {1686#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1686#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:19,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1693#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:19,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1693#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1693#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:19,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {1693#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1700#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:19,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(main_~x~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} main_~x~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume !(main_~x~0#1 < main_~n~0#1); {1663#false} is VALID [2022-02-20 14:01:19,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1663#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {1663#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {1663#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1663#false} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#false} main_~v~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {1663#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {1663#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {1663#false} is VALID [2022-02-20 14:01:19,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {1663#false} elem_exists_#res#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {1663#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {1663#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {1663#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {1663#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1663#false} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {1663#false} main_~x~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {1663#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {1663#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L272 TraceCheckUtils]: 29: Hoare triple {1663#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#false} ~cond := #in~cond; {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#false} assume 0 == ~cond; {1663#false} is VALID [2022-02-20 14:01:19,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#false} assume !false; {1663#false} is VALID [2022-02-20 14:01:19,708 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:01:19,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:19,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#false} assume !false; {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#false} assume 0 == ~cond; {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#false} ~cond := #in~cond; {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L272 TraceCheckUtils]: 29: Hoare triple {1663#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {1663#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {1663#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1663#false} is VALID [2022-02-20 14:01:19,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {1663#false} main_~x~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1663#false} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1663#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1663#false} is VALID [2022-02-20 14:01:19,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {1663#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {1663#false} is VALID [2022-02-20 14:01:19,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {1663#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {1663#false} is VALID [2022-02-20 14:01:19,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {1663#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {1663#false} is VALID [2022-02-20 14:01:19,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {1663#false} elem_exists_#res#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1663#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {1663#false} is VALID [2022-02-20 14:01:19,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1663#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#false} main_~v~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {1663#false} assume !(main_~v~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {1663#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1663#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1663#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume !(main_~x~0#1 < main_~n~0#1); {1663#false} is VALID [2022-02-20 14:01:19,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} main_~x~0#1 := 0; {1663#false} is VALID [2022-02-20 14:01:19,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {1663#false} is VALID [2022-02-20 14:01:19,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1840#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1836#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:19,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {1840#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1840#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:19,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1840#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:19,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1847#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:19,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1854#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1847#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:19,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {1854#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1854#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:19,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {1861#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1854#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:19,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1861#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:19,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1861#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:19,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#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(42, 2); {1662#true} is VALID [2022-02-20 14:01:19,927 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:01:19,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192984460] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:19,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:19,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:01:19,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068465648] [2022-02-20 14:01:19,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:01:19,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:19,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:01:19,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:01:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:01:19,974 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:20,557 INFO L93 Difference]: Finished difference Result 187 states and 243 transitions. [2022-02-20 14:01:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:01:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:01:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 208 transitions. [2022-02-20 14:01:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 208 transitions. [2022-02-20 14:01:20,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 208 transitions. [2022-02-20 14:01:20,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:20,753 INFO L225 Difference]: With dead ends: 187 [2022-02-20 14:01:20,753 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 14:01:20,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:01:20,754 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 339 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:20,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 122 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:01:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 14:01:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 72. [2022-02-20 14:01:20,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:20,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:20,789 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:20,790 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:20,794 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2022-02-20 14:01:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2022-02-20 14:01:20,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:20,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:20,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-02-20 14:01:20,797 INFO L87 Difference]: Start difference. First operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-02-20 14:01:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:20,801 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2022-02-20 14:01:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2022-02-20 14:01:20,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:20,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:20,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:20,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2022-02-20 14:01:20,805 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 33 [2022-02-20 14:01:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:20,806 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2022-02-20 14:01:20,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-02-20 14:01:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 14:01:20,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:20,809 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:20,836 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:01:21,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:21,036 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1439765920, now seen corresponding path program 1 times [2022-02-20 14:01:21,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:21,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837267853] [2022-02-20 14:01:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:21,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:21,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {2545#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(42, 2); {2545#true} is VALID [2022-02-20 14:01:21,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2545#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {2545#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2545#true} is VALID [2022-02-20 14:01:21,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {2545#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2545#true} is VALID [2022-02-20 14:01:21,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {2545#true} assume !(main_~x~0#1 < 100000); {2545#true} is VALID [2022-02-20 14:01:21,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {2545#true} main_~x~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {2545#true} assume !(main_~x~0#1 < main_~n~0#1); {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {2545#true} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {2545#true} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {2545#true} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {2545#true} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {2545#true} assume !(main_~v~0#1 < 100000); {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {2545#true} main_~v~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {2545#true} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {2545#true} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {2545#true} elem_exists_#res#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {2545#true} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {2545#true} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {2545#true} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {2545#true} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2545#true} is VALID [2022-02-20 14:01:21,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {2545#true} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2545#true} is VALID [2022-02-20 14:01:21,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {2545#true} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2545#true} is VALID [2022-02-20 14:01:21,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {2545#true} elem_exists_#res#1 := 0; {2547#(= 0 |ULTIMATE.start_elem_exists_#res#1|)} is VALID [2022-02-20 14:01:21,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {2547#(= 0 |ULTIMATE.start_elem_exists_#res#1|)} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2548#(= |ULTIMATE.start_main_#t~ret13#1| 0)} is VALID [2022-02-20 14:01:21,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {2548#(= |ULTIMATE.start_main_#t~ret13#1| 0)} assume !(0 == main_#t~ret13#1);havoc main_#t~mem12#1;havoc main_#t~ret13#1; {2546#false} is VALID [2022-02-20 14:01:21,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {2546#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2546#false} is VALID [2022-02-20 14:01:21,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {2546#false} assume !(main_~v~0#1 < 100000); {2546#false} is VALID [2022-02-20 14:01:21,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {2546#false} main_~x~0#1 := 0; {2546#false} is VALID [2022-02-20 14:01:21,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {2546#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2546#false} is VALID [2022-02-20 14:01:21,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {2546#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2546#false} is VALID [2022-02-20 14:01:21,218 INFO L272 TraceCheckUtils]: 49: Hoare triple {2546#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2546#false} is VALID [2022-02-20 14:01:21,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {2546#false} ~cond := #in~cond; {2546#false} is VALID [2022-02-20 14:01:21,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {2546#false} assume 0 == ~cond; {2546#false} is VALID [2022-02-20 14:01:21,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {2546#false} assume !false; {2546#false} is VALID [2022-02-20 14:01:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-02-20 14:01:21,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:21,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837267853] [2022-02-20 14:01:21,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837267853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:21,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:21,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:01:21,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914632574] [2022-02-20 14:01:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:01:21,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:21,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:21,241 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:01:21,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:01:21,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:01:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:21,243 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:21,328 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2022-02-20 14:01:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 14:01:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 14:01:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 14:01:21,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 14:01:21,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:21,380 INFO L225 Difference]: With dead ends: 94 [2022-02-20 14:01:21,380 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 14:01:21,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:21,385 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:21,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 14:01:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 14:01:21,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:21,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:21,420 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:21,420 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:21,422 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-20 14:01:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 14:01:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:21,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-02-20 14:01:21,423 INFO L87 Difference]: Start difference. First operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-02-20 14:01:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:21,424 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-20 14:01:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 14:01:21,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:21,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:21,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:21,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-20 14:01:21,427 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 53 [2022-02-20 14:01:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:21,428 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-20 14:01:21,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 14:01:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 14:01:21,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:21,429 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:21,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:01:21,430 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1385301982, now seen corresponding path program 2 times [2022-02-20 14:01:21,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:21,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707954775] [2022-02-20 14:01:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:21,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {2906#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(42, 2); {2906#true} is VALID [2022-02-20 14:01:21,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {2906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2908#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:21,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2908#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2908#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:21,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {2908#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:21,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:21,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:21,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:21,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:21,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:21,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:21,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:21,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:21,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:21,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:21,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:21,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:21,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:21,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:21,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:21,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:21,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2918#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:21,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2918#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:21,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {2907#false} assume !(main_~x~0#1 < main_~n~0#1); {2907#false} is VALID [2022-02-20 14:01:21,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {2907#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:21,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2907#false} main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:21,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:21,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:21,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:21,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:21,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:21,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:21,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:21,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:21,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {2907#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2907#false} is VALID [2022-02-20 14:01:21,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {2907#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2907#false} is VALID [2022-02-20 14:01:21,677 INFO L272 TraceCheckUtils]: 50: Hoare triple {2907#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2907#false} is VALID [2022-02-20 14:01:21,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {2907#false} ~cond := #in~cond; {2907#false} is VALID [2022-02-20 14:01:21,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {2907#false} assume 0 == ~cond; {2907#false} is VALID [2022-02-20 14:01:21,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {2907#false} assume !false; {2907#false} is VALID [2022-02-20 14:01:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:01:21,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:21,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707954775] [2022-02-20 14:01:21,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707954775] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:21,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424576501] [2022-02-20 14:01:21,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:01:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:21,682 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:01:21,687 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:01:21,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:01:21,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:21,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:01:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:21,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:22,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {2906#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(42, 2); {2906#true} is VALID [2022-02-20 14:01:22,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2925#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:22,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {2925#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2925#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:22,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {2925#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:22,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:22,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {2909#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:22,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:22,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2910#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:22,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:22,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2911#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:22,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:22,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:22,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:22,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {2913#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:22,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:22,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {2914#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:22,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:22,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {2915#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:22,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:22,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {2916#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:22,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:22,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {2917#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2918#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {2918#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2907#false} assume !(main_~x~0#1 < main_~n~0#1); {2907#false} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2907#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:22,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:22,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:22,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:22,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {2907#false} main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:22,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:22,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {2907#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {2907#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2907#false} is VALID [2022-02-20 14:01:22,066 INFO L272 TraceCheckUtils]: 50: Hoare triple {2907#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2907#false} is VALID [2022-02-20 14:01:22,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {2907#false} ~cond := #in~cond; {2907#false} is VALID [2022-02-20 14:01:22,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {2907#false} assume 0 == ~cond; {2907#false} is VALID [2022-02-20 14:01:22,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {2907#false} assume !false; {2907#false} is VALID [2022-02-20 14:01:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:01:22,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:22,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {2907#false} assume !false; {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {2907#false} assume 0 == ~cond; {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {2907#false} ~cond := #in~cond; {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L272 TraceCheckUtils]: 50: Hoare triple {2907#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {2907#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {2907#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2907#false} is VALID [2022-02-20 14:01:22,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:22,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:22,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {2907#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2907#false} is VALID [2022-02-20 14:01:22,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {2907#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2907#false} is VALID [2022-02-20 14:01:22,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {2907#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2907#false} is VALID [2022-02-20 14:01:22,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {2907#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2907#false} is VALID [2022-02-20 14:01:22,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {2907#false} elem_exists_#res#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {2907#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2907#false} is VALID [2022-02-20 14:01:22,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {2907#false} main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {2907#false} assume !(main_~v~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:22,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:22,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {2907#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2907#false} is VALID [2022-02-20 14:01:22,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {2907#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2907#false} is VALID [2022-02-20 14:01:22,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {2907#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {2907#false} assume !(main_~x~0#1 < main_~n~0#1); {2907#false} is VALID [2022-02-20 14:01:22,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {2907#false} main_~x~0#1 := 0; {2907#false} is VALID [2022-02-20 14:01:22,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {2907#false} is VALID [2022-02-20 14:01:22,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3175#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:22,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3179#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:22,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {3186#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3179#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:22,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {3186#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3186#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:22,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {3193#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3186#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:22,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {3193#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3193#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:22,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {3200#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3193#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:22,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {3200#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3200#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:22,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {3207#(< |ULTIMATE.start_main_~x~0#1| 99995)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3200#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:22,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {3207#(< |ULTIMATE.start_main_~x~0#1| 99995)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3207#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-20 14:01:22,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {3214#(< |ULTIMATE.start_main_~x~0#1| 99994)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3207#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-20 14:01:22,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {3214#(< |ULTIMATE.start_main_~x~0#1| 99994)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3214#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-20 14:01:22,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {3221#(< |ULTIMATE.start_main_~x~0#1| 99993)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3214#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-20 14:01:22,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#(< |ULTIMATE.start_main_~x~0#1| 99993)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3221#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-20 14:01:22,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {3228#(< |ULTIMATE.start_main_~x~0#1| 99992)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3221#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-20 14:01:22,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {3228#(< |ULTIMATE.start_main_~x~0#1| 99992)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3228#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-20 14:01:22,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#(< |ULTIMATE.start_main_~x~0#1| 99991)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3228#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-20 14:01:22,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {3235#(< |ULTIMATE.start_main_~x~0#1| 99991)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3235#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-20 14:01:22,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {3242#(< |ULTIMATE.start_main_~x~0#1| 99990)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3235#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-20 14:01:22,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {3242#(< |ULTIMATE.start_main_~x~0#1| 99990)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3242#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-20 14:01:22,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {3242#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-20 14:01:22,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {2906#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(42, 2); {2906#true} is VALID [2022-02-20 14:01:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:01:22,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424576501] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:22,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:22,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:01:22,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924744790] [2022-02-20 14:01:22,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 14:01:22,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:22,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:22,571 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:01:22,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:01:22,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:22,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:01:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:01:22,573 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:23,428 INFO L93 Difference]: Finished difference Result 261 states and 332 transitions. [2022-02-20 14:01:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:01:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 14:01:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2022-02-20 14:01:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2022-02-20 14:01:23,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 302 transitions. [2022-02-20 14:01:23,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:23,683 INFO L225 Difference]: With dead ends: 261 [2022-02-20 14:01:23,683 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 14:01:23,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 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:01:23,684 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 380 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:23,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 158 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:01:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 14:01:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 88. [2022-02-20 14:01:23,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:23,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:23,754 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:23,755 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:23,762 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2022-02-20 14:01:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2022-02-20 14:01:23,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:23,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:23,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 220 states. [2022-02-20 14:01:23,764 INFO L87 Difference]: Start difference. First operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 220 states. [2022-02-20 14:01:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:23,771 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2022-02-20 14:01:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2022-02-20 14:01:23,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:23,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:23,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:23,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 14:01:23,775 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 54 [2022-02-20 14:01:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:23,775 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 14:01:23,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 14:01:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 14:01:23,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:23,777 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:23,803 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:01:23,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:23,996 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 359833914, now seen corresponding path program 3 times [2022-02-20 14:01:23,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:23,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106549322] [2022-02-20 14:01:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:24,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {4203#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(42, 2); {4203#true} is VALID [2022-02-20 14:01:24,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {4205#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:24,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {4205#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4205#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:24,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {4205#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4206#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:24,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {4206#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4206#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:24,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4207#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:24,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {4207#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4207#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:24,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {4207#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4208#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:24,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {4208#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4208#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:24,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {4208#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4209#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:24,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {4209#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4209#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:24,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {4209#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4210#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:24,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {4210#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4210#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:24,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {4210#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4211#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:24,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {4211#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4211#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:24,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {4211#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4212#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:24,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {4212#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4212#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:24,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {4212#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4213#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:24,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {4213#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4213#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:24,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {4213#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4214#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:24,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {4214#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4214#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:24,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {4214#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4215#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:24,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {4215#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4215#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:24,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4216#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:24,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {4216#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4216#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:24,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {4216#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4217#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:24,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {4217#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4217#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:24,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {4217#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4218#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:24,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {4218#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4218#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:24,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {4218#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4219#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:24,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {4219#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4219#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:24,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {4219#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4220#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:24,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {4220#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4220#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:24,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {4220#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4221#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:24,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {4221#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4221#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:24,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {4221#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4222#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:24,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {4222#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4222#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:24,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {4222#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4223#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:24,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {4223#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4223#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:24,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {4223#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4224#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:24,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {4224#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4224#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:24,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {4224#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4225#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:24,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {4225#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4225#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:24,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {4225#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4226#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:24,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {4226#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4226#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:24,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {4226#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4227#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {4227#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !(main_~x~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#false} main_~x~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#false} assume !(main_~x~0#1 < main_~n~0#1); {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {4204#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {4204#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {4204#false} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:24,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {4204#false} main_~v~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {4204#false} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {4204#false} main_~x~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {4204#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {4204#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L272 TraceCheckUtils]: 74: Hoare triple {4204#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 75: Hoare triple {4204#false} ~cond := #in~cond; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {4204#false} assume 0 == ~cond; {4204#false} is VALID [2022-02-20 14:01:24,601 INFO L290 TraceCheckUtils]: 77: Hoare triple {4204#false} assume !false; {4204#false} is VALID [2022-02-20 14:01:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:01:24,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:24,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106549322] [2022-02-20 14:01:24,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106549322] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:24,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768815071] [2022-02-20 14:01:24,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:01:24,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:24,604 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:01:24,616 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:01:24,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:01:24,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:24,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:01:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:24,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:25,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {4203#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(42, 2); {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {4203#true} assume !(main_~x~0#1 < 100000); {4203#true} is VALID [2022-02-20 14:01:25,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {4203#true} main_~x~0#1 := 0; {4203#true} is VALID [2022-02-20 14:01:25,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {4203#true} assume !(main_~x~0#1 < main_~n~0#1); {4203#true} is VALID [2022-02-20 14:01:25,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {4203#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {4378#(<= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:25,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {4378#(<= |ULTIMATE.start_main_~v~0#1| 0)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4378#(<= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:25,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {4378#(<= |ULTIMATE.start_main_~v~0#1| 0)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4385#(<= |ULTIMATE.start_main_~v~0#1| 1)} is VALID [2022-02-20 14:01:25,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {4385#(<= |ULTIMATE.start_main_~v~0#1| 1)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4385#(<= |ULTIMATE.start_main_~v~0#1| 1)} is VALID [2022-02-20 14:01:25,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {4385#(<= |ULTIMATE.start_main_~v~0#1| 1)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4392#(<= |ULTIMATE.start_main_~v~0#1| 2)} is VALID [2022-02-20 14:01:25,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {4392#(<= |ULTIMATE.start_main_~v~0#1| 2)} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:25,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {4204#false} main_~v~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:25,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 70: Hoare triple {4204#false} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {4204#false} main_~x~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {4204#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {4204#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L272 TraceCheckUtils]: 74: Hoare triple {4204#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {4204#false} ~cond := #in~cond; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 76: Hoare triple {4204#false} assume 0 == ~cond; {4204#false} is VALID [2022-02-20 14:01:25,017 INFO L290 TraceCheckUtils]: 77: Hoare triple {4204#false} assume !false; {4204#false} is VALID [2022-02-20 14:01:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-02-20 14:01:25,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:25,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {4204#false} assume !false; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {4204#false} assume 0 == ~cond; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {4204#false} ~cond := #in~cond; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L272 TraceCheckUtils]: 74: Hoare triple {4204#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {4204#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {4204#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {4204#false} main_~x~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {4204#false} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:25,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {4204#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {4204#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {4204#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {4204#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {4204#false} elem_exists_#res#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {4204#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {4204#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {4204#false} main_~v~0#1 := 0; {4204#false} is VALID [2022-02-20 14:01:25,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {4534#(< |ULTIMATE.start_main_~v~0#1| 100000)} assume !(main_~v~0#1 < 100000); {4204#false} is VALID [2022-02-20 14:01:25,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {4538#(< |ULTIMATE.start_main_~v~0#1| 99999)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4534#(< |ULTIMATE.start_main_~v~0#1| 100000)} is VALID [2022-02-20 14:01:25,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {4538#(< |ULTIMATE.start_main_~v~0#1| 99999)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4538#(< |ULTIMATE.start_main_~v~0#1| 99999)} is VALID [2022-02-20 14:01:25,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {4545#(< |ULTIMATE.start_main_~v~0#1| 99998)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4538#(< |ULTIMATE.start_main_~v~0#1| 99999)} is VALID [2022-02-20 14:01:25,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {4545#(< |ULTIMATE.start_main_~v~0#1| 99998)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4545#(< |ULTIMATE.start_main_~v~0#1| 99998)} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {4203#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {4545#(< |ULTIMATE.start_main_~v~0#1| 99998)} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {4203#true} assume !(main_~x~0#1 < main_~n~0#1); {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {4203#true} main_~x~0#1 := 0; {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {4203#true} assume !(main_~x~0#1 < 100000); {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {4203#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4203#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {4203#true} is VALID [2022-02-20 14:01:25,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {4203#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(42, 2); {4203#true} is VALID [2022-02-20 14:01:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-02-20 14:01:25,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768815071] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:25,250 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:25,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5, 5] total 31 [2022-02-20 14:01:25,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783387981] [2022-02-20 14:01:25,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 14:01:25,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:25,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:25,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:25,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-20 14:01:25,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-20 14:01:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:01:25,322 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:27,497 INFO L93 Difference]: Finished difference Result 314 states and 392 transitions. [2022-02-20 14:01:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 14:01:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 14:01:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 377 transitions. [2022-02-20 14:01:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 377 transitions. [2022-02-20 14:01:27,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 377 transitions. [2022-02-20 14:01:27,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:27,826 INFO L225 Difference]: With dead ends: 314 [2022-02-20 14:01:27,826 INFO L226 Difference]: Without dead ends: 273 [2022-02-20 14:01:27,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 14:01:27,828 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 595 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:27,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 357 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:01:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-20 14:01:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 134. [2022-02-20 14:01:27,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:27,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:27,948 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:27,949 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:27,962 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2022-02-20 14:01:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 335 transitions. [2022-02-20 14:01:27,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:27,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:27,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-02-20 14:01:27,965 INFO L87 Difference]: Start difference. First operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-02-20 14:01:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:27,971 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2022-02-20 14:01:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 335 transitions. [2022-02-20 14:01:27,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:27,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:27,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2022-02-20 14:01:27,976 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 78 [2022-02-20 14:01:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:27,976 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2022-02-20 14:01:27,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2022-02-20 14:01:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-20 14:01:27,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:27,978 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:27,998 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:01:28,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:28,187 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash 140841668, now seen corresponding path program 4 times [2022-02-20 14:01:28,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:28,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656594295] [2022-02-20 14:01:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:28,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#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(42, 2); {5912#true} is VALID [2022-02-20 14:01:28,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5914#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:28,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {5914#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5914#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:28,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {5914#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:28,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:28,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:28,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:28,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:28,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:28,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:28,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:28,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:28,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:28,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:28,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:28,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:28,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:28,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:28,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:28,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:28,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:28,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:28,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:28,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:28,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:28,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:28,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:28,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:28,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:28,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:28,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:28,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:28,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:28,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:28,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:28,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:28,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:28,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:28,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:28,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:28,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:28,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:28,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:28,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:28,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:28,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:28,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:28,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5937#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {5937#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !(main_~x~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {5913#false} assume !(main_~x~0#1 < main_~n~0#1); {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {5913#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {5913#false} main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 67: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,655 INFO L290 TraceCheckUtils]: 69: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 81: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,660 INFO L290 TraceCheckUtils]: 82: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 87: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,661 INFO L290 TraceCheckUtils]: 88: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 91: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 94: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,662 INFO L290 TraceCheckUtils]: 95: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 97: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 98: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 99: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 100: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,663 INFO L290 TraceCheckUtils]: 101: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 102: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 106: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 107: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:28,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L290 TraceCheckUtils]: 109: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L290 TraceCheckUtils]: 110: Hoare triple {5913#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L290 TraceCheckUtils]: 111: Hoare triple {5913#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L272 TraceCheckUtils]: 112: Hoare triple {5913#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L290 TraceCheckUtils]: 113: Hoare triple {5913#false} ~cond := #in~cond; {5913#false} is VALID [2022-02-20 14:01:28,665 INFO L290 TraceCheckUtils]: 114: Hoare triple {5913#false} assume 0 == ~cond; {5913#false} is VALID [2022-02-20 14:01:28,666 INFO L290 TraceCheckUtils]: 115: Hoare triple {5913#false} assume !false; {5913#false} is VALID [2022-02-20 14:01:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-02-20 14:01:28,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:28,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656594295] [2022-02-20 14:01:28,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656594295] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:28,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341277951] [2022-02-20 14:01:28,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:01:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:28,668 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:01:28,669 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:01:28,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:01:28,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:28,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:01:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:28,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:29,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#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(42, 2); {5912#true} is VALID [2022-02-20 14:01:29,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5944#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:29,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {5944#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5944#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:29,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {5944#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:29,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:29,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {5915#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:29,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:29,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {5916#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:29,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:29,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:29,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:29,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {5918#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:29,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:29,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {5919#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:29,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:29,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {5920#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:29,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:29,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {5921#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:29,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:29,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {5922#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:29,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:29,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {5923#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:29,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:29,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {5924#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:29,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:29,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {5925#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:29,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:29,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {5926#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:29,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:29,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {5927#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:29,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:29,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {5928#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:29,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:29,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {5929#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:29,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:29,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {5930#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:29,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:29,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {5931#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:29,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:29,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {5932#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:29,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:29,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {5933#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:29,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:29,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {5934#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:29,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:29,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {5935#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:29,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:29,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {5936#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5937#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-20 14:01:29,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {5937#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !(main_~x~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {5913#false} assume !(main_~x~0#1 < main_~n~0#1); {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {5913#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:29,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {5913#false} main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 87: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 88: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 90: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 91: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 92: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 94: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 95: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 96: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 98: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 99: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 100: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 101: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,867 INFO L290 TraceCheckUtils]: 102: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 103: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 104: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 105: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 106: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 107: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 108: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 110: Hoare triple {5913#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {5913#false} is VALID [2022-02-20 14:01:29,868 INFO L290 TraceCheckUtils]: 111: Hoare triple {5913#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {5913#false} is VALID [2022-02-20 14:01:29,869 INFO L272 TraceCheckUtils]: 112: Hoare triple {5913#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {5913#false} is VALID [2022-02-20 14:01:29,869 INFO L290 TraceCheckUtils]: 113: Hoare triple {5913#false} ~cond := #in~cond; {5913#false} is VALID [2022-02-20 14:01:29,869 INFO L290 TraceCheckUtils]: 114: Hoare triple {5913#false} assume 0 == ~cond; {5913#false} is VALID [2022-02-20 14:01:29,869 INFO L290 TraceCheckUtils]: 115: Hoare triple {5913#false} assume !false; {5913#false} is VALID [2022-02-20 14:01:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-02-20 14:01:29,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:31,151 INFO L290 TraceCheckUtils]: 115: Hoare triple {5913#false} assume !false; {5913#false} is VALID [2022-02-20 14:01:31,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {5913#false} assume 0 == ~cond; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 113: Hoare triple {5913#false} ~cond := #in~cond; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L272 TraceCheckUtils]: 112: Hoare triple {5913#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 111: Hoare triple {5913#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {5913#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 108: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 107: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 106: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 103: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 102: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 101: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 100: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 99: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 98: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 97: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 95: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 92: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 91: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 90: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 89: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 88: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 87: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 85: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 84: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,154 INFO L290 TraceCheckUtils]: 83: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 78: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,155 INFO L290 TraceCheckUtils]: 77: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {5913#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {5913#false} is VALID [2022-02-20 14:01:31,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {5913#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {5913#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {5913#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {5913#false} elem_exists_#res#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {5913#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {5913#false} main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {5913#false} assume !(main_~v~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {5913#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5913#false} is VALID [2022-02-20 14:01:31,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {5913#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5913#false} is VALID [2022-02-20 14:01:31,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {5913#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {5913#false} assume !(main_~x~0#1 < main_~n~0#1); {5913#false} is VALID [2022-02-20 14:01:31,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {5913#false} main_~x~0#1 := 0; {5913#false} is VALID [2022-02-20 14:01:31,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {6488#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {5913#false} is VALID [2022-02-20 14:01:31,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {6492#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6488#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:31,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {6492#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6492#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:31,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {6499#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6492#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:31,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {6499#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6499#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:31,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {6506#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6499#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:31,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {6506#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6506#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:31,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {6513#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6506#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:31,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {6513#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6513#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:31,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {6520#(< |ULTIMATE.start_main_~x~0#1| 99995)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6513#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:31,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {6520#(< |ULTIMATE.start_main_~x~0#1| 99995)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6520#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-20 14:01:31,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {6527#(< |ULTIMATE.start_main_~x~0#1| 99994)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6520#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-20 14:01:31,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {6527#(< |ULTIMATE.start_main_~x~0#1| 99994)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6527#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-20 14:01:31,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {6534#(< |ULTIMATE.start_main_~x~0#1| 99993)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6527#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-20 14:01:31,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {6534#(< |ULTIMATE.start_main_~x~0#1| 99993)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6534#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-20 14:01:31,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {6541#(< |ULTIMATE.start_main_~x~0#1| 99992)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6534#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-20 14:01:31,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {6541#(< |ULTIMATE.start_main_~x~0#1| 99992)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6541#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-20 14:01:31,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {6548#(< |ULTIMATE.start_main_~x~0#1| 99991)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6541#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-20 14:01:31,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {6548#(< |ULTIMATE.start_main_~x~0#1| 99991)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6548#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-20 14:01:31,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {6555#(< |ULTIMATE.start_main_~x~0#1| 99990)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6548#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-20 14:01:31,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {6555#(< |ULTIMATE.start_main_~x~0#1| 99990)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6555#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-20 14:01:31,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {6562#(< |ULTIMATE.start_main_~x~0#1| 99989)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6555#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-20 14:01:31,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {6562#(< |ULTIMATE.start_main_~x~0#1| 99989)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6562#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-20 14:01:31,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#(< |ULTIMATE.start_main_~x~0#1| 99988)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6562#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-20 14:01:31,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {6569#(< |ULTIMATE.start_main_~x~0#1| 99988)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6569#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-20 14:01:31,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {6576#(< |ULTIMATE.start_main_~x~0#1| 99987)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6569#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-20 14:01:31,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {6576#(< |ULTIMATE.start_main_~x~0#1| 99987)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6576#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-20 14:01:31,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {6583#(< |ULTIMATE.start_main_~x~0#1| 99986)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6576#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-20 14:01:31,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {6583#(< |ULTIMATE.start_main_~x~0#1| 99986)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6583#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-20 14:01:31,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {6590#(< |ULTIMATE.start_main_~x~0#1| 99985)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6583#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-20 14:01:31,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {6590#(< |ULTIMATE.start_main_~x~0#1| 99985)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6590#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-20 14:01:31,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {6597#(< |ULTIMATE.start_main_~x~0#1| 99984)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6590#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-20 14:01:31,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {6597#(< |ULTIMATE.start_main_~x~0#1| 99984)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6597#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-20 14:01:31,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {6604#(< |ULTIMATE.start_main_~x~0#1| 99983)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6597#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-20 14:01:31,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {6604#(< |ULTIMATE.start_main_~x~0#1| 99983)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6604#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-20 14:01:31,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {6611#(< |ULTIMATE.start_main_~x~0#1| 99982)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6604#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-20 14:01:31,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {6611#(< |ULTIMATE.start_main_~x~0#1| 99982)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6611#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-20 14:01:31,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {6618#(< |ULTIMATE.start_main_~x~0#1| 99981)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6611#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-20 14:01:31,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {6618#(< |ULTIMATE.start_main_~x~0#1| 99981)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6618#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-20 14:01:31,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {6625#(< |ULTIMATE.start_main_~x~0#1| 99980)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6618#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-20 14:01:31,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(< |ULTIMATE.start_main_~x~0#1| 99980)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6625#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-20 14:01:31,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {6632#(< |ULTIMATE.start_main_~x~0#1| 99979)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6625#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-20 14:01:31,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {6632#(< |ULTIMATE.start_main_~x~0#1| 99979)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6632#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-20 14:01:31,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {6639#(< |ULTIMATE.start_main_~x~0#1| 99978)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6632#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-20 14:01:31,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {6639#(< |ULTIMATE.start_main_~x~0#1| 99978)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6639#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-20 14:01:31,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {6646#(< |ULTIMATE.start_main_~x~0#1| 99977)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6639#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-20 14:01:31,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {6646#(< |ULTIMATE.start_main_~x~0#1| 99977)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {6646#(< |ULTIMATE.start_main_~x~0#1| 99977)} is VALID [2022-02-20 14:01:31,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {6646#(< |ULTIMATE.start_main_~x~0#1| 99977)} is VALID [2022-02-20 14:01:31,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#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(42, 2); {5912#true} is VALID [2022-02-20 14:01:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-02-20 14:01:31,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341277951] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:31,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:31,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2022-02-20 14:01:31,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624392988] [2022-02-20 14:01:31,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-02-20 14:01:31,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:31,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:31,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:31,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-20 14:01:31,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-20 14:01:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 14:01:31,274 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:35,766 INFO L93 Difference]: Finished difference Result 557 states and 709 transitions. [2022-02-20 14:01:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-20 14:01:35,766 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-02-20 14:01:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 575 transitions. [2022-02-20 14:01:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 575 transitions. [2022-02-20 14:01:35,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 575 transitions. [2022-02-20 14:01:36,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:36,205 INFO L225 Difference]: With dead ends: 557 [2022-02-20 14:01:36,206 INFO L226 Difference]: Without dead ends: 472 [2022-02-20 14:01:36,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 14:01:36,209 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 953 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:36,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 304 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 14:01:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-20 14:01:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 184. [2022-02-20 14:01:36,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:36,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:36,398 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:36,399 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,418 INFO L93 Difference]: Finished difference Result 472 states and 584 transitions. [2022-02-20 14:01:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 584 transitions. [2022-02-20 14:01:36,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-02-20 14:01:36,427 INFO L87 Difference]: Start difference. First operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-02-20 14:01:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,447 INFO L93 Difference]: Finished difference Result 472 states and 584 transitions. [2022-02-20 14:01:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 584 transitions. [2022-02-20 14:01:36,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:36,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 181 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:01:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2022-02-20 14:01:36,453 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 116 [2022-02-20 14:01:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:36,453 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2022-02-20 14:01:36,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 51 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2022-02-20 14:01:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-02-20 14:01:36,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:36,459 INFO L514 BasicCegarLoop]: trace histogram [48, 48, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:36,478 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:01:36,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:36,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2022982902, now seen corresponding path program 5 times [2022-02-20 14:01:36,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:36,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460944039] [2022-02-20 14:01:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:37,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {8693#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(42, 2); {8693#true} is VALID [2022-02-20 14:01:37,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {8693#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~post11#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {8695#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:37,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {8695#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8695#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:37,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {8695#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8696#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:37,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {8696#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8696#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:37,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {8696#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8697#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:37,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {8697#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8697#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:37,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {8697#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8698#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:37,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {8698#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8698#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:37,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {8698#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8699#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:37,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {8699#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8699#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:37,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {8699#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8700#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:37,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {8700#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8700#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-20 14:01:37,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {8700#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8701#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:37,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {8701#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8701#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-20 14:01:37,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {8701#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8702#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:37,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {8702#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8702#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-20 14:01:37,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {8702#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8703#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:37,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {8703#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8703#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-20 14:01:37,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {8703#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8704#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:37,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {8704#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8704#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 14:01:37,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {8704#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8705#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:37,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {8705#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8705#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 14:01:37,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {8705#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8706#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:37,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {8706#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8706#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-20 14:01:37,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {8706#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8707#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:37,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {8707#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8707#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-20 14:01:37,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {8707#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8708#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:37,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {8708#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8708#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-20 14:01:37,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {8708#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8709#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:37,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {8709#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8709#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-20 14:01:37,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {8709#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8710#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:37,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {8710#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8710#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-20 14:01:37,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {8710#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8711#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:37,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {8711#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8711#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-20 14:01:37,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {8711#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8712#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:37,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {8712#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8712#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-20 14:01:37,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {8712#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8713#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:37,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {8713#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8713#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-20 14:01:37,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {8713#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8714#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:37,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {8714#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8714#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-20 14:01:37,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {8714#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8715#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:37,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {8715#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8715#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-20 14:01:37,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {8715#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8716#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:37,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {8716#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8716#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-20 14:01:37,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {8716#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8717#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:37,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {8717#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8717#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-20 14:01:37,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {8717#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8718#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-20 14:01:37,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {8718#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8718#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-20 14:01:37,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {8718#(<= |ULTIMATE.start_main_~x~0#1| 23)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8719#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-20 14:01:37,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {8719#(<= |ULTIMATE.start_main_~x~0#1| 24)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8719#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-20 14:01:37,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {8719#(<= |ULTIMATE.start_main_~x~0#1| 24)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8720#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-20 14:01:37,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {8720#(<= |ULTIMATE.start_main_~x~0#1| 25)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8720#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-20 14:01:37,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {8720#(<= |ULTIMATE.start_main_~x~0#1| 25)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8721#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-20 14:01:37,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {8721#(<= |ULTIMATE.start_main_~x~0#1| 26)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8721#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-20 14:01:37,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {8721#(<= |ULTIMATE.start_main_~x~0#1| 26)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8722#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-20 14:01:37,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {8722#(<= |ULTIMATE.start_main_~x~0#1| 27)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8722#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-20 14:01:37,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {8722#(<= |ULTIMATE.start_main_~x~0#1| 27)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8723#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-20 14:01:37,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {8723#(<= |ULTIMATE.start_main_~x~0#1| 28)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8723#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-20 14:01:37,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {8723#(<= |ULTIMATE.start_main_~x~0#1| 28)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8724#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-20 14:01:37,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {8724#(<= |ULTIMATE.start_main_~x~0#1| 29)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8724#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-20 14:01:37,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {8724#(<= |ULTIMATE.start_main_~x~0#1| 29)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8725#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-20 14:01:37,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {8725#(<= |ULTIMATE.start_main_~x~0#1| 30)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8725#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-20 14:01:37,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {8725#(<= |ULTIMATE.start_main_~x~0#1| 30)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8726#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-20 14:01:37,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {8726#(<= |ULTIMATE.start_main_~x~0#1| 31)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8726#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-20 14:01:37,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {8726#(<= |ULTIMATE.start_main_~x~0#1| 31)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8727#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-20 14:01:37,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {8727#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8727#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-20 14:01:37,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {8727#(<= |ULTIMATE.start_main_~x~0#1| 32)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8728#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-20 14:01:37,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {8728#(<= |ULTIMATE.start_main_~x~0#1| 33)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8728#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-20 14:01:37,994 INFO L290 TraceCheckUtils]: 69: Hoare triple {8728#(<= |ULTIMATE.start_main_~x~0#1| 33)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8729#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-20 14:01:37,994 INFO L290 TraceCheckUtils]: 70: Hoare triple {8729#(<= |ULTIMATE.start_main_~x~0#1| 34)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8729#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-20 14:01:37,994 INFO L290 TraceCheckUtils]: 71: Hoare triple {8729#(<= |ULTIMATE.start_main_~x~0#1| 34)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8730#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-20 14:01:37,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {8730#(<= |ULTIMATE.start_main_~x~0#1| 35)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8730#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-20 14:01:37,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {8730#(<= |ULTIMATE.start_main_~x~0#1| 35)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8731#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-20 14:01:37,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {8731#(<= |ULTIMATE.start_main_~x~0#1| 36)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8731#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-20 14:01:37,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {8731#(<= |ULTIMATE.start_main_~x~0#1| 36)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8732#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-20 14:01:37,997 INFO L290 TraceCheckUtils]: 76: Hoare triple {8732#(<= |ULTIMATE.start_main_~x~0#1| 37)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8732#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-20 14:01:37,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {8732#(<= |ULTIMATE.start_main_~x~0#1| 37)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8733#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-20 14:01:37,998 INFO L290 TraceCheckUtils]: 78: Hoare triple {8733#(<= |ULTIMATE.start_main_~x~0#1| 38)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8733#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-20 14:01:37,998 INFO L290 TraceCheckUtils]: 79: Hoare triple {8733#(<= |ULTIMATE.start_main_~x~0#1| 38)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8734#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-20 14:01:37,999 INFO L290 TraceCheckUtils]: 80: Hoare triple {8734#(<= |ULTIMATE.start_main_~x~0#1| 39)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8734#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-20 14:01:37,999 INFO L290 TraceCheckUtils]: 81: Hoare triple {8734#(<= |ULTIMATE.start_main_~x~0#1| 39)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8735#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-20 14:01:37,999 INFO L290 TraceCheckUtils]: 82: Hoare triple {8735#(<= |ULTIMATE.start_main_~x~0#1| 40)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8735#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-20 14:01:38,000 INFO L290 TraceCheckUtils]: 83: Hoare triple {8735#(<= |ULTIMATE.start_main_~x~0#1| 40)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8736#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-20 14:01:38,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {8736#(<= |ULTIMATE.start_main_~x~0#1| 41)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8736#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-20 14:01:38,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {8736#(<= |ULTIMATE.start_main_~x~0#1| 41)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8737#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-20 14:01:38,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {8737#(<= |ULTIMATE.start_main_~x~0#1| 42)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8737#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-20 14:01:38,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {8737#(<= |ULTIMATE.start_main_~x~0#1| 42)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8738#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-20 14:01:38,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {8738#(<= |ULTIMATE.start_main_~x~0#1| 43)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8738#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-20 14:01:38,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {8738#(<= |ULTIMATE.start_main_~x~0#1| 43)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8739#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-20 14:01:38,007 INFO L290 TraceCheckUtils]: 90: Hoare triple {8739#(<= |ULTIMATE.start_main_~x~0#1| 44)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8739#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-20 14:01:38,008 INFO L290 TraceCheckUtils]: 91: Hoare triple {8739#(<= |ULTIMATE.start_main_~x~0#1| 44)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8740#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-20 14:01:38,008 INFO L290 TraceCheckUtils]: 92: Hoare triple {8740#(<= |ULTIMATE.start_main_~x~0#1| 45)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8740#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-20 14:01:38,009 INFO L290 TraceCheckUtils]: 93: Hoare triple {8740#(<= |ULTIMATE.start_main_~x~0#1| 45)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8741#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-20 14:01:38,009 INFO L290 TraceCheckUtils]: 94: Hoare triple {8741#(<= |ULTIMATE.start_main_~x~0#1| 46)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8741#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-20 14:01:38,009 INFO L290 TraceCheckUtils]: 95: Hoare triple {8741#(<= |ULTIMATE.start_main_~x~0#1| 46)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8742#(<= |ULTIMATE.start_main_~x~0#1| 47)} is VALID [2022-02-20 14:01:38,010 INFO L290 TraceCheckUtils]: 96: Hoare triple {8742#(<= |ULTIMATE.start_main_~x~0#1| 47)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {8742#(<= |ULTIMATE.start_main_~x~0#1| 47)} is VALID [2022-02-20 14:01:38,010 INFO L290 TraceCheckUtils]: 97: Hoare triple {8742#(<= |ULTIMATE.start_main_~x~0#1| 47)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {8743#(<= |ULTIMATE.start_main_~x~0#1| 48)} is VALID [2022-02-20 14:01:38,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {8743#(<= |ULTIMATE.start_main_~x~0#1| 48)} assume !(main_~x~0#1 < 100000); {8694#false} is VALID [2022-02-20 14:01:38,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {8694#false} main_~x~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {8694#false} assume !(main_~x~0#1 < main_~n~0#1); {8694#false} is VALID [2022-02-20 14:01:38,011 INFO L290 TraceCheckUtils]: 101: Hoare triple {8694#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,011 INFO L290 TraceCheckUtils]: 102: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 103: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 104: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 105: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 106: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 107: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 108: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,012 INFO L290 TraceCheckUtils]: 109: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 110: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 111: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 112: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 113: Hoare triple {8694#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 114: Hoare triple {8694#false} assume !(main_~v~0#1 < 100000); {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 115: Hoare triple {8694#false} main_~v~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,013 INFO L290 TraceCheckUtils]: 116: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 117: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 118: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 119: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 120: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 121: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,014 INFO L290 TraceCheckUtils]: 122: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 123: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 124: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 125: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 126: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 127: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 128: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,015 INFO L290 TraceCheckUtils]: 129: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 130: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 131: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 132: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 133: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 134: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 135: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,016 INFO L290 TraceCheckUtils]: 136: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 137: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 138: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 139: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 140: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 141: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,017 INFO L290 TraceCheckUtils]: 142: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 143: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 144: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 145: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 146: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 147: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 148: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,018 INFO L290 TraceCheckUtils]: 149: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 150: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 151: Hoare triple {8694#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 152: Hoare triple {8694#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 153: Hoare triple {8694#false} elem_exists_#res#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 154: Hoare triple {8694#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {8694#false} is VALID [2022-02-20 14:01:38,019 INFO L290 TraceCheckUtils]: 155: Hoare triple {8694#false} assume 0 == main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 156: Hoare triple {8694#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 157: Hoare triple {8694#false} main_#t~post11#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 158: Hoare triple {8694#false} assume !(main_~v~0#1 < 100000); {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 159: Hoare triple {8694#false} main_~x~0#1 := 0; {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 160: Hoare triple {8694#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {8694#false} is VALID [2022-02-20 14:01:38,020 INFO L290 TraceCheckUtils]: 161: Hoare triple {8694#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {8694#false} is VALID [2022-02-20 14:01:38,021 INFO L272 TraceCheckUtils]: 162: Hoare triple {8694#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {8694#false} is VALID [2022-02-20 14:01:38,021 INFO L290 TraceCheckUtils]: 163: Hoare triple {8694#false} ~cond := #in~cond; {8694#false} is VALID [2022-02-20 14:01:38,021 INFO L290 TraceCheckUtils]: 164: Hoare triple {8694#false} assume 0 == ~cond; {8694#false} is VALID [2022-02-20 14:01:38,021 INFO L290 TraceCheckUtils]: 165: Hoare triple {8694#false} assume !false; {8694#false} is VALID [2022-02-20 14:01:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-02-20 14:01:38,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:38,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460944039] [2022-02-20 14:01:38,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460944039] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:38,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396879918] [2022-02-20 14:01:38,023 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:01:38,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:38,025 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:01:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process