./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array12_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array12_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:23,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:23,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:24,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:24,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:24,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:24,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:24,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:24,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:24,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:24,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:24,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:24,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:24,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:24,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:24,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:24,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:24,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:24,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:24,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:24,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:24,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:24,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:24,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:24,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:24,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:24,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:24,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:24,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:24,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:24,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:24,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:24,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:24,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:24,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:24,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:24,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:24,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:24,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:24,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:24,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:24,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:34:24,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:24,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:24,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:24,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:24,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:24,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:24,080 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:24,080 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:24,080 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:24,080 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:24,081 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:24,081 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:24,081 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:24,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:24,081 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:24,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:24,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:24,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:24,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:24,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:24,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:24,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:24,085 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:24,085 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2022-02-21 03:34:24,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:24,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:24,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:24,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:24,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:24,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array12_alloca.i [2022-02-21 03:34:24,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec608f16/aa77f074fcfb4696a47a261833c1a4e5/FLAG652c5621b [2022-02-21 03:34:24,830 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:24,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array12_alloca.i [2022-02-21 03:34:24,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec608f16/aa77f074fcfb4696a47a261833c1a4e5/FLAG652c5621b [2022-02-21 03:34:24,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec608f16/aa77f074fcfb4696a47a261833c1a4e5 [2022-02-21 03:34:24,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:24,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:24,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:24,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:24,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:24,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:24" (1/1) ... [2022-02-21 03:34:24,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f9e2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:24, skipping insertion in model container [2022-02-21 03:34:24,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:24" (1/1) ... [2022-02-21 03:34:24,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:24,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:25,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:25,177 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:25,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:25,247 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:25,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25 WrapperNode [2022-02-21 03:34:25,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:25,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:25,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:25,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:25,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,275 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-21 03:34:25,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:25,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:25,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:25,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:25,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:25,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:25,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:25,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:25,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (1/1) ... [2022-02-21 03:34:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:25,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:25,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:34:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:25,436 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:25,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:25,629 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:25,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:25,633 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:25,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:25 BoogieIcfgContainer [2022-02-21 03:34:25,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:25,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:25,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:25,638 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:25,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:25,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:24" (1/3) ... [2022-02-21 03:34:25,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@195a7bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:25, skipping insertion in model container [2022-02-21 03:34:25,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:25,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:25" (2/3) ... [2022-02-21 03:34:25,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@195a7bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:25, skipping insertion in model container [2022-02-21 03:34:25,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:25,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:25" (3/3) ... [2022-02-21 03:34:25,641 INFO L388 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2022-02-21 03:34:25,684 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:25,684 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:25,684 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:25,685 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:25,685 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:25,685 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:25,694 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:25,694 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:25,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:25,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:25,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:25,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:25,731 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:25,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:25,731 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:25,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:25,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:25,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:25,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:25,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:25,735 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:25,740 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2022-02-21 03:34:25,741 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2022-02-21 03:34:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:25,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:25,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136430265] [2022-02-21 03:34:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-02-21 03:34:25,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:25,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887559700] [2022-02-21 03:34:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,922 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-02-21 03:34:25,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:25,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491990238] [2022-02-21 03:34:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:25,982 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:26,277 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:26,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:26,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:26,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:26,278 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:26,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:26,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:26,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2022-02-21 03:34:26,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:26,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:26,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:26,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:26,652 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:26,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:34:26,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:26,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:26,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:26,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:34:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:34:26,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:26,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:26,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:34:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:34:26,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:26,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:26,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:26,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:26,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:26,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:26,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:34:26,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:34:26,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:26,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:26,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:26,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:34:26,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:26,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:26,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:34:26,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:34:26,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:26,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:26,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:26,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:26,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:26,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:26,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:26,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:26,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:26,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:26,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:26,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:26,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:27,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:27,026 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:34:27,026 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:34:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:27,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:27,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:27,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:34:27,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:27,068 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:27,068 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:27,068 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 Supporting invariants [] [2022-02-21 03:34:27,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:27,120 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:27,125 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1;" [2022-02-21 03:34:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:27,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2022-02-21 03:34:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {25#unseeded} is VALID [2022-02-21 03:34:27,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0#1 < 1); {25#unseeded} is VALID [2022-02-21 03:34:27,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {25#unseeded} is VALID [2022-02-21 03:34:27,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:34:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:27,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:27,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:27,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:34:27,270 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-21 03:34:27,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:27,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-02-21 03:34:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:27,376 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:27,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:27,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:27,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:27,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:27,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:27,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:27,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2022-02-21 03:34:27,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:27,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:27,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:27,400 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:27,403 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:34:27,403 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:27,406 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:27,406 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:27,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:27,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:27,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:27,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:27,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:27,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:27,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:27,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:27,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:27,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:27,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:27,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:27,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:27,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,429 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:34:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:27,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:34:27,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:34:27,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:27,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:27,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:27,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-02-21 03:34:27,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:27,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:27,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:34:27,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:27,447 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:34:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:34:27,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:27,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,468 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,470 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:27,479 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:27,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:27,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:27,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:34:27,480 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:34:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:27,481 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:27,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:27,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:27,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:27,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:34:27,483 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:27,483 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:27,483 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:27,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:27,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:27,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:27,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:27,484 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:27,484 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:27,484 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 130#L367 assume !(main_~length~0#1 < 1); 124#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 125#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 126#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 127#L370-4 main_~j~0#1 := 0; 128#L378-2 [2022-02-21 03:34:27,484 INFO L793 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 129#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 128#L378-2 [2022-02-21 03:34:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-02-21 03:34:27,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:27,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691878153] [2022-02-21 03:34:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:27,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2022-02-21 03:34:27,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {161#true} is VALID [2022-02-21 03:34:27,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0#1 < 1); {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:27,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:27,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:27,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {162#false} is VALID [2022-02-21 03:34:27,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0#1 := 0; {162#false} is VALID [2022-02-21 03:34:27,551 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-21 03:34:27,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:27,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691878153] [2022-02-21 03:34:27,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691878153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:27,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:27,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:27,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453162736] [2022-02-21 03:34:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:27,554 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-02-21 03:34:27,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:27,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359367651] [2022-02-21 03:34:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,581 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:27,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:27,632 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:27,672 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:27,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:27,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 03:34:27,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:27,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:34:27,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:34:27,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:27,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:34:27,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:27,682 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:34:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:34:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-02-21 03:34:27,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:27,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,684 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,684 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:27,685 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:27,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:27,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:27,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:34:27,688 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:34:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:27,692 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:27,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:27,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:27,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:27,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:34:27,694 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:27,694 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:27,694 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:27,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:27,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:27,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:27,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:27,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:27,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:27,696 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 189#L367 assume !(main_~length~0#1 < 1); 183#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 184#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 185#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 190#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 192#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 191#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 186#L370-4 main_~j~0#1 := 0; 187#L378-2 [2022-02-21 03:34:27,696 INFO L793 eck$LassoCheckResult]: Loop: 187#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 188#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 187#L378-2 [2022-02-21 03:34:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-02-21 03:34:27,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:27,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004868949] [2022-02-21 03:34:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,745 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-02-21 03:34:27,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:27,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786615702] [2022-02-21 03:34:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:27,767 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:27,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-02-21 03:34:27,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:27,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523049318] [2022-02-21 03:34:27,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:27,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:27,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:27,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:27,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:27,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:27,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {233#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:27,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:27,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:27,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:27,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {236#(and (<= 0 |ULTIMATE.start_main_#t~mem210#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:27,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#(and (<= 0 |ULTIMATE.start_main_#t~mem210#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:27,898 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-21 03:34:27,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:27,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523049318] [2022-02-21 03:34:27,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523049318] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:27,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45122800] [2022-02-21 03:34:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:27,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:27,899 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:27,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:34:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:34:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:27,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:28,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:34:28,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:34:28,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:28,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:28,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:28,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:28,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {255#(and (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(and (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:28,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {271#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:28,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:28,144 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-21 03:34:28,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:28,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-21 03:34:28,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-02-21 03:34:28,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:28,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {278#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {271#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:28,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} main_~j~0#1 := 0; {278#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:34:28,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} assume !(main_~i~0#1 < main_~length~0#1); {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:28,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:28,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(or (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (< |ULTIMATE.start_main_#t~mem209#1| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {282#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:28,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {292#(or (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (< |ULTIMATE.start_main_#t~mem209#1| 0))} is VALID [2022-02-21 03:34:28,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {228#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {296#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} is VALID [2022-02-21 03:34:28,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {228#true} is VALID [2022-02-21 03:34:28,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:28,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:28,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:28,354 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-21 03:34:28,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45122800] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:28,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:28,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-02-21 03:34:28,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610320734] [2022-02-21 03:34:28,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:28,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:34:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:34:28,409 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:28,587 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:34:28,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,604 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-21 03:34:28,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-02-21 03:34:28,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:28,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-02-21 03:34:28,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:34:28,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:34:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-02-21 03:34:28,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:28,607 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-21 03:34:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-02-21 03:34:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-02-21 03:34:28,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:28,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,608 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,608 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:28,609 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-21 03:34:28,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:28,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:28,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 30 transitions. [2022-02-21 03:34:28,609 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 30 transitions. [2022-02-21 03:34:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:28,610 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-21 03:34:28,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:28,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:28,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:28,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:34:28,611 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:34:28,611 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:34:28,611 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:28,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:34:28,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:28,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:28,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:28,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:28,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:28,612 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 343#L367 assume !(main_~length~0#1 < 1); 337#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 338#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 339#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 344#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 345#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 346#L370-4 main_~j~0#1 := 0; 352#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 340#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 341#L378-2 [2022-02-21 03:34:28,613 INFO L793 eck$LassoCheckResult]: Loop: 341#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 349#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 341#L378-2 [2022-02-21 03:34:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-02-21 03:34:28,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:28,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50428919] [2022-02-21 03:34:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:28,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:28,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-02-21 03:34:28,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:28,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135563711] [2022-02-21 03:34:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:28,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:28,641 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-02-21 03:34:28,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:28,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924329561] [2022-02-21 03:34:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:28,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:28,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:28,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:28,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {407#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:28,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {407#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:28,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:28,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:28,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {409#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:28,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {410#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4))} is VALID [2022-02-21 03:34:28,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4))} main_~j~0#1 := 0; {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:28,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:28,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {412#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} is VALID [2022-02-21 03:34:28,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:28,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:28,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:28,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924329561] [2022-02-21 03:34:28,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924329561] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:28,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987943662] [2022-02-21 03:34:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:28,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:28,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:28,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:34:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:28,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:34:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:28,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:28,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:28,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:28,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:28,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {405#true} is VALID [2022-02-21 03:34:28,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:28,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:28,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:28,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:28,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:28,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:28,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:28,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {453#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:28,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {453#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:28,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:28,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:29,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:29,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:29,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {463#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:29,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:34:29,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:34:29,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:29,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:29,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:29,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:29,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:29,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {405#true} is VALID [2022-02-21 03:34:29,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:29,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:29,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:29,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987943662] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:29,032 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:29,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-02-21 03:34:29,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860352838] [2022-02-21 03:34:29,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:29,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:34:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:34:29,072 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,456 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-21 03:34:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:34:29,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:29,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2022-02-21 03:34:29,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:29,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2022-02-21 03:34:29,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:34:29,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:34:29,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-02-21 03:34:29,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:29,481 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-02-21 03:34:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-02-21 03:34:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-02-21 03:34:29,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:29,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,483 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,483 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,484 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-21 03:34:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-02-21 03:34:29,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:29,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:29,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states and 50 transitions. [2022-02-21 03:34:29,484 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states and 50 transitions. [2022-02-21 03:34:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,486 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-21 03:34:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-02-21 03:34:29,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:29,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:29,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:29,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-21 03:34:29,487 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:34:29,487 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:34:29,487 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:34:29,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:34:29,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:29,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:29,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:29,488 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:29,488 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:29,488 INFO L791 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 553#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 561#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 554#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 555#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 556#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 563#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 572#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 573#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 574#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 569#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 570#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 557#L370-4 main_~j~0#1 := 0; 558#L378-2 [2022-02-21 03:34:29,488 INFO L793 eck$LassoCheckResult]: Loop: 558#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 568#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 558#L378-2 [2022-02-21 03:34:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-02-21 03:34:29,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098050525] [2022-02-21 03:34:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:29,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {665#true} is VALID [2022-02-21 03:34:29,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {665#true} is VALID [2022-02-21 03:34:29,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:29,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {668#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:29,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {668#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:29,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:29,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:29,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {670#(and (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:29,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:29,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#false} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:29,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#false} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {666#false} is VALID [2022-02-21 03:34:29,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#false} assume !(main_~i~0#1 < main_~length~0#1); {666#false} is VALID [2022-02-21 03:34:29,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#false} main_~j~0#1 := 0; {666#false} is VALID [2022-02-21 03:34:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:29,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:29,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098050525] [2022-02-21 03:34:29,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098050525] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:29,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953444889] [2022-02-21 03:34:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:29,656 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:29,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:34:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:29,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:29,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:29,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {665#true} is VALID [2022-02-21 03:34:29,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {665#true} is VALID [2022-02-21 03:34:29,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:29,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:29,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:29,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:29,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:29,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {696#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:29,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {696#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:29,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#false} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:29,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#false} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {666#false} is VALID [2022-02-21 03:34:29,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#false} assume !(main_~i~0#1 < main_~length~0#1); {666#false} is VALID [2022-02-21 03:34:29,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#false} main_~j~0#1 := 0; {666#false} is VALID [2022-02-21 03:34:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:29,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:34:29,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953444889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:29,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:34:29,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-02-21 03:34:29,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512592365] [2022-02-21 03:34:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:29,787 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-02-21 03:34:29,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194163063] [2022-02-21 03:34:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,797 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:34:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:34:29,835 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,867 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 03:34:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:34:29,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:29,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-02-21 03:34:29,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:29,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-02-21 03:34:29,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:34:29,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:34:29,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-02-21 03:34:29,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:29,880 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-02-21 03:34:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:34:29,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:29,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,881 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,881 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,882 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:34:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:29,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:29,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:29,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 27 transitions. [2022-02-21 03:34:29,882 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 27 transitions. [2022-02-21 03:34:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:29,883 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:34:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:29,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:29,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:29,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:29,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 03:34:29,884 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:29,884 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:29,885 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:34:29,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:29,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:29,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:29,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:29,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:29,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:29,886 INFO L791 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 746#L367 assume !(main_~length~0#1 < 1); 740#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 741#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 742#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 747#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 750#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 748#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 749#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 757#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 754#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 745#L370-4 main_~j~0#1 := 0; 744#L378-2 [2022-02-21 03:34:29,886 INFO L793 eck$LassoCheckResult]: Loop: 744#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 751#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 744#L378-2 [2022-02-21 03:34:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-02-21 03:34:29,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567576031] [2022-02-21 03:34:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,905 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-02-21 03:34:29,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18987150] [2022-02-21 03:34:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,913 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-02-21 03:34:29,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117315792] [2022-02-21 03:34:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:30,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:30,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:30,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:30,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {813#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {814#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-21 03:34:30,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {814#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-21 03:34:30,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {814#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:30,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {817#(and (<= 0 |ULTIMATE.start_main_#t~mem210#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:30,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {817#(and (<= 0 |ULTIMATE.start_main_#t~mem210#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:30,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:30,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117315792] [2022-02-21 03:34:30,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117315792] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:30,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472321240] [2022-02-21 03:34:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:34:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:34:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:30,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:34:30,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:30,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-21 03:34:30,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:30,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-21 03:34:30,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:34:30,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:30,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:30,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:30,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:30,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {836#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {813#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:30,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:34:30,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {862#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:30,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:30,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:42,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|))))) is different from false [2022-02-21 03:34:54,668 WARN L228 SmtUtils]: Spent 12.00s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-21 03:34:54,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:34:54,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2022-02-21 03:34:54,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:54,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {862#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:34:54,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} main_~j~0#1 := 0; {869#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:34:54,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} assume !(main_~i~0#1 < main_~length~0#1); {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:54,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:54,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {873#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|))} is VALID [2022-02-21 03:34:54,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {883#(forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))} is VALID [2022-02-21 03:34:54,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {883#(forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))} is VALID [2022-02-21 03:34:54,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {894#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|))))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {890#(forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|)))))} is VALID [2022-02-21 03:34:54,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {894#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|))))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} is VALID [2022-02-21 03:34:54,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {808#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {898#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} is VALID [2022-02-21 03:34:54,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {808#true} is VALID [2022-02-21 03:34:54,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:54,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:54,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-21 03:34:54,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472321240] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:54,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:54,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-02-21 03:34:54,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399322059] [2022-02-21 03:34:54,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:54,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:55,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:34:55,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=239, Unknown=1, NotChecked=32, Total=342 [2022-02-21 03:34:55,000 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:07,078 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|))))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:35:19,131 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|)) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:35:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:19,266 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:35:19,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:19,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2022-02-21 03:35:19,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:19,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 03:35:19,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:35:19,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:35:19,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2022-02-21 03:35:19,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:19,295 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2022-02-21 03:35:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2022-02-21 03:35:19,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:19,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,296 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,296 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:19,297 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:19,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:19,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:19,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states and 39 transitions. [2022-02-21 03:35:19,297 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states and 39 transitions. [2022-02-21 03:35:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:19,298 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:19,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:19,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:19,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:19,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 03:35:19,299 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:35:19,299 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:35:19,299 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:35:19,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:35:19,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:19,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:19,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:19,316 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:19,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:19,316 INFO L791 eck$LassoCheckResult]: Stem: 956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 957#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 965#L367 assume !(main_~length~0#1 < 1); 958#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 959#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 960#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 966#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 971#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 967#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 968#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 969#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 970#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 961#L370-4 main_~j~0#1 := 0; 962#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 963#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 964#L378-2 [2022-02-21 03:35:19,316 INFO L793 eck$LassoCheckResult]: Loop: 964#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 972#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 964#L378-2 [2022-02-21 03:35:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-02-21 03:35:19,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364991975] [2022-02-21 03:35:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,336 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-02-21 03:35:19,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100305933] [2022-02-21 03:35:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,342 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-02-21 03:35:19,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836850419] [2022-02-21 03:35:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:19,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:19,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:19,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:19,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:19,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:19,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1046#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:19,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1047#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:19,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_~j~0#1 := 0; {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:19,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:19,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1050#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:19,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1050#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:19,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:19,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:19,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836850419] [2022-02-21 03:35:19,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836850419] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:19,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927310489] [2022-02-21 03:35:19,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:19,453 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:19,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:35:19,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:19,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:19,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:35:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:19,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:19,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:35:19,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-21 03:35:19,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:19,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:19,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:19,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:19,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:19,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1079#(exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:35:19,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_~j~0#1 := 0; {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:19,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:19,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {1049#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1098#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:19,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:19,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:19,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:19,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-02-21 03:35:19,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-21 03:35:19,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:19,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1050#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:19,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1111#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1050#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:19,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1111#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1111#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:19,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_~j~0#1 := 0; {1111#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:19,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(or (< |ULTIMATE.start_main_#t~mem209#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:19,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1127#(or (< |ULTIMATE.start_main_#t~mem209#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:19,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:19,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:19,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927310489] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:19,965 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:19,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-02-21 03:35:19,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736838826] [2022-02-21 03:35:19,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:20,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:35:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:35:20,004 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:20,208 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:35:20,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:20,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-02-21 03:35:20,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:20,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-02-21 03:35:20,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:35:20,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:35:20,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:35:20,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:20,228 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:35:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-02-21 03:35:20,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:20,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,229 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,229 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:20,230 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:20,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:20,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:20,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 37 transitions. [2022-02-21 03:35:20,230 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 37 transitions. [2022-02-21 03:35:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:20,231 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:20,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:20,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:20,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:20,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-21 03:35:20,231 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:35:20,231 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:35:20,231 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:35:20,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:35:20,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:20,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,232 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:20,232 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:20,232 INFO L791 eck$LassoCheckResult]: Stem: 1183#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1191#L367 assume !(main_~length~0#1 < 1); 1185#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1186#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1187#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1192#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1193#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1194#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1195#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1197#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1198#L370-4 main_~j~0#1 := 0; 1203#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1190#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1189#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1196#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1202#L378-2 [2022-02-21 03:35:20,232 INFO L793 eck$LassoCheckResult]: Loop: 1202#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1201#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1202#L378-2 [2022-02-21 03:35:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-02-21 03:35:20,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300443259] [2022-02-21 03:35:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-02-21 03:35:20,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374025769] [2022-02-21 03:35:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,275 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-02-21 03:35:20,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104840871] [2022-02-21 03:35:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:20,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:20,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:20,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1274#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:20,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:20,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:20,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1277#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {1278#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} main_~j~0#1 := 0; {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:20,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:20,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1281#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:20,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {1281#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:20,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:20,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:20,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104840871] [2022-02-21 03:35:20,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104840871] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:20,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632544187] [2022-02-21 03:35:20,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:35:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:20,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:35:20,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:35:20,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:20,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:20,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:20,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:20,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:20,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1272#true} is VALID [2022-02-21 03:35:20,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:20,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:35:20,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 0; {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1339#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:20,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {1339#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:20,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:20,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:20,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:20,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1349#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:20,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1349#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:35:20,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:20,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:20,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:20,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 0; {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:20,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:35:20,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:20,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:20,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:20,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1272#true} is VALID [2022-02-21 03:35:20,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:20,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:20,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:20,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632544187] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:20,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:20,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-02-21 03:35:20,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944793449] [2022-02-21 03:35:20,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:20,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:35:20,812 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,047 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-21 03:35:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:35:21,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:21,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-02-21 03:35:21,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:21,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-02-21 03:35:21,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:21,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:21,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:35:21,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:21,074 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:35:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-02-21 03:35:21,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:21,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,075 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,075 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,076 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:21,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 37 transitions. [2022-02-21 03:35:21,076 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 37 transitions. [2022-02-21 03:35:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,077 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:21,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:21,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-21 03:35:21,078 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 03:35:21,078 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 03:35:21,078 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:35:21,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-02-21 03:35:21,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:21,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,078 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:21,078 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:21,078 INFO L791 eck$LassoCheckResult]: Stem: 1443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1452#L367 assume !(main_~length~0#1 < 1); 1445#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1446#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1447#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1453#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1468#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1467#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1456#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1457#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1454#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1455#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1465#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1463#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1462#L370-4 main_~j~0#1 := 0; 1451#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1461#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1460#L378-2 [2022-02-21 03:35:21,079 INFO L793 eck$LassoCheckResult]: Loop: 1460#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1459#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1460#L378-2 [2022-02-21 03:35:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-02-21 03:35:21,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764405957] [2022-02-21 03:35:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,106 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-02-21 03:35:21,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342439273] [2022-02-21 03:35:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,112 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,113 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-02-21 03:35:21,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250102299] [2022-02-21 03:35:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:21,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:21,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:21,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1534#true} is VALID [2022-02-21 03:35:21,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1534#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:21,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1538#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:21,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1538#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1539#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:21,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {1539#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:21,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:21,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} assume !(main_~i~0#1 < main_~length~0#1); {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_~j~0#1 := 0; {1542#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:21,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1542#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:21,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1543#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:21,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1543#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:21,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:21,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:21,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250102299] [2022-02-21 03:35:21,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250102299] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:21,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778333638] [2022-02-21 03:35:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:21,234 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:21,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:35:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:35:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:21,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:35:21,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:21,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-21 03:35:21,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:21,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-21 03:35:21,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:35:21,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:21,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:21,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:21,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1557#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:35:21,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {1557#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1571#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1575#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1575#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1579#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1579#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1583#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {1583#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1583#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {1583#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~length~0#1); {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {1590#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_~j~0#1 := 0; {1600#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:21,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {1600#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1600#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:21,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {1600#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1607#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {1607#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:21,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:21,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:21,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:35:21,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-02-21 03:35:21,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:21,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1543#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:21,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {1620#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1543#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:21,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {1620#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1620#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:21,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_~j~0#1 := 0; {1620#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:21,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} assume !(main_~i~0#1 < main_~length~0#1); {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1541#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))} is VALID [2022-02-21 03:35:21,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:21,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1540#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:21,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {1646#(or (and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1642#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4))))} is VALID [2022-02-21 03:35:21,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1646#(or (and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} is VALID [2022-02-21 03:35:21,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:21,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {1534#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:21,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1534#true} is VALID [2022-02-21 03:35:21,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:21,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:21,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:21,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778333638] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:21,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:21,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-02-21 03:35:21,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011299528] [2022-02-21 03:35:21,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:21,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:35:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:35:21,987 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,390 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:35:22,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:22,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2022-02-21 03:35:22,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:22,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2022-02-21 03:35:22,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:35:22,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:35:22,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2022-02-21 03:35:22,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:22,423 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-21 03:35:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2022-02-21 03:35:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-21 03:35:22,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:22,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,424 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,424 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,425 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-21 03:35:22,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states and 37 transitions. [2022-02-21 03:35:22,425 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states and 37 transitions. [2022-02-21 03:35:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,426 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-21 03:35:22,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:22,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:35:22,427 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:35:22,427 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:35:22,427 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:35:22,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:35:22,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:22,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:22,428 INFO L791 eck$LassoCheckResult]: Stem: 1709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1718#L367 assume !(main_~length~0#1 < 1); 1711#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1712#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1713#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1719#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1725#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1726#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1727#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1728#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1720#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1721#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1722#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1724#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1714#L370-4 main_~j~0#1 := 0; 1715#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1716#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1717#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1723#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1730#L378-2 [2022-02-21 03:35:22,428 INFO L793 eck$LassoCheckResult]: Loop: 1730#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1729#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1730#L378-2 [2022-02-21 03:35:22,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-02-21 03:35:22,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398118460] [2022-02-21 03:35:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,458 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-02-21 03:35:22,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081336409] [2022-02-21 03:35:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,464 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-02-21 03:35:22,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270510926] [2022-02-21 03:35:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:22,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:22,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:22,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:22,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1798#true} is VALID [2022-02-21 03:35:22,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {1798#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:22,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:22,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:22,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:22,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:22,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:22,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:22,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1803#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:22,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {1803#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1804#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:22,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1804#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:22,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} assume !(main_~i~0#1 < main_~length~0#1); {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:22,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_~j~0#1 := 0; {1806#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:22,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1806#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:22,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1806#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:22,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:22,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1808#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:22,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1808#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:22,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:22,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:22,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270510926] [2022-02-21 03:35:22,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270510926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:22,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949515141] [2022-02-21 03:35:22,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:35:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:22,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,575 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:22,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:35:22,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:35:22,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:22,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:35:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:22,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:22,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-21 03:35:22,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:35:22,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:22,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:22,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:22,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1822#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:35:22,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {1822#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1846#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1850#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))))} is VALID [2022-02-21 03:35:22,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1854#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {1864#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:22,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1864#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1864#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:22,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1871#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:22,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {1871#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1871#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:22,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {1871#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1878#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:22,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {1878#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:22,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:22,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:23,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-02-21 03:35:23,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-21 03:35:23,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:23,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {1808#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:23,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1808#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {1897#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1807#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {1897#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1897#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_~j~0#1 := 0; {1897#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} assume !(main_~i~0#1 < main_~length~0#1); {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:23,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:23,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(or (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1805#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:23,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1913#(or (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} is VALID [2022-02-21 03:35:23,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:23,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {1798#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1798#true} is VALID [2022-02-21 03:35:23,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:23,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:23,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:23,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949515141] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:23,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:23,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2022-02-21 03:35:23,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464263668] [2022-02-21 03:35:23,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:23,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:35:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:35:23,153 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,610 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:35:23,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:23,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-02-21 03:35:23,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:23,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2022-02-21 03:35:23,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:35:23,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 03:35:23,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2022-02-21 03:35:23,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:23,648 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-02-21 03:35:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2022-02-21 03:35:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-21 03:35:23,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:23,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,650 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,650 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,651 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 03:35:23,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states and 45 transitions. [2022-02-21 03:35:23,652 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states and 45 transitions. [2022-02-21 03:35:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,652 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 03:35:23,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:23,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-02-21 03:35:23,654 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:23,654 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:23,654 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:35:23,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:23,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:23,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:23,655 INFO L791 eck$LassoCheckResult]: Stem: 1991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1999#L367 assume !(main_~length~0#1 < 1); 1993#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1994#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1995#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2000#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2008#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2009#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2010#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2011#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2001#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2002#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2004#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2005#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2006#L370-4 main_~j~0#1 := 0; 2016#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1996#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1997#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2003#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2015#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2014#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2013#L378-2 [2022-02-21 03:35:23,655 INFO L793 eck$LassoCheckResult]: Loop: 2013#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2012#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2013#L378-2 [2022-02-21 03:35:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2022-02-21 03:35:23,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971957114] [2022-02-21 03:35:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,679 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-02-21 03:35:23,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917126031] [2022-02-21 03:35:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,685 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2022-02-21 03:35:23,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267202640] [2022-02-21 03:35:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:23,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:23,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:23,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2101#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:23,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {2101#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:23,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:23,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:23,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2105#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 12 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 12 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {2106#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {2106#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:23,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:23,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:23,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:23,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2110#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} is VALID [2022-02-21 03:35:23,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {2110#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:23,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:23,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:23,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267202640] [2022-02-21 03:35:23,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267202640] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:23,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291997621] [2022-02-21 03:35:23,822 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:35:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:35:23,874 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-21 03:35:23,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:23,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:24,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:24,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:24,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2099#true} is VALID [2022-02-21 03:35:24,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {2099#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:24,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~length~0#1); {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:24,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} main_~j~0#1 := 0; {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:24,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2167#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {2167#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2185#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 3 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {2185#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 3 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:24,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:24,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:24,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:24,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {2195#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:24,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2195#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:35:24,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:24,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:24,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {2213#(<= |ULTIMATE.start_main_~length~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2213#(<= |ULTIMATE.start_main_~length~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:24,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} main_~j~0#1 := 0; {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:24,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~length~0#1); {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:24,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:24,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:24,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:24,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {2099#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2099#true} is VALID [2022-02-21 03:35:24,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:24,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:24,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:24,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291997621] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:24,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:24,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-02-21 03:35:24,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465176271] [2022-02-21 03:35:24,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:24,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:24,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:35:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:35:24,304 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,852 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-02-21 03:35:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:35:24,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:24,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2022-02-21 03:35:24,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2022-02-21 03:35:24,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:35:24,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:24,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2022-02-21 03:35:24,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:24,891 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:35:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2022-02-21 03:35:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 03:35:24,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:24,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,892 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,892 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,893 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-21 03:35:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:35:24,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states and 43 transitions. [2022-02-21 03:35:24,893 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states and 43 transitions. [2022-02-21 03:35:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,894 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-21 03:35:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:35:24,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:24,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 03:35:24,895 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:24,895 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:24,895 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:35:24,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:24,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,896 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:24,896 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:24,896 INFO L791 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2328#L367 assume !(main_~length~0#1 < 1); 2322#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2323#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2324#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2329#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2350#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2330#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2331#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2333#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2334#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2349#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2347#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2337#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2338#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2339#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2327#L370-4 main_~j~0#1 := 0; 2326#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2332#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2344#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2343#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2342#L378-2 [2022-02-21 03:35:24,896 INFO L793 eck$LassoCheckResult]: Loop: 2342#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2341#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2342#L378-2 [2022-02-21 03:35:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2022-02-21 03:35:24,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708420436] [2022-02-21 03:35:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,923 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-02-21 03:35:24,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373685753] [2022-02-21 03:35:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,928 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2022-02-21 03:35:24,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250041504] [2022-02-21 03:35:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:25,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:25,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:25,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:25,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2431#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {2431#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2432#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {2432#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:25,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:25,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_~j~0#1 := 0; {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:25,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:25,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2437#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:25,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:25,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:25,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250041504] [2022-02-21 03:35:25,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250041504] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:25,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885760012] [2022-02-21 03:35:25,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:25,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,069 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:35:25,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:25,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:25,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:35:25,425 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-21 03:35:25,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-21 03:35:25,583 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-21 03:35:25,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-21 03:35:25,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-21 03:35:25,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:25,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:25,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:25,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:25,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2432#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:25,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {2432#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} is VALID [2022-02-21 03:35:25,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} is VALID [2022-02-21 03:35:25,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:25,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_~j~0#1 := 0; {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {2435#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2504#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:25,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {2504#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2504#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:25,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {2504#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2511#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))))} is VALID [2022-02-21 03:35:25,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {2511#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:25,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:26,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:35:26,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-02-21 03:35:26,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:26,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:26,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2437#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:26,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:26,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {2530#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2436#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:26,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {2530#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2530#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:26,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_~j~0#1 := 0; {2530#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:26,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:26,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:26,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)))} is VALID [2022-02-21 03:35:26,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:26,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2552#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (<= |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2433#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:26,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(or (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (<= |ULTIMATE.start_main_~i~0#1| 1))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2552#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:35:26,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2556#(or (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8))) (not (<= |ULTIMATE.start_main_~i~0#1| 1))) (< |ULTIMATE.start_main_#t~mem209#1| 0))} is VALID [2022-02-21 03:35:26,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:26,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:26,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885760012] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:26,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:26,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2022-02-21 03:35:26,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692179132] [2022-02-21 03:35:26,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:26,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:35:26,166 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:26,550 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:35:26,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:26,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-02-21 03:35:26,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:26,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-02-21 03:35:26,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:35:26,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 03:35:26,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-02-21 03:35:26,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:26,589 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-02-21 03:35:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-02-21 03:35:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2022-02-21 03:35:26,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:26,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,591 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,591 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:26,592 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:35:26,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states and 56 transitions. [2022-02-21 03:35:26,593 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states and 56 transitions. [2022-02-21 03:35:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:26,594 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:35:26,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:26,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-21 03:35:26,595 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 03:35:26,595 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 03:35:26,595 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 03:35:26,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2022-02-21 03:35:26,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,605 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:26,605 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:26,606 INFO L791 eck$LassoCheckResult]: Stem: 2643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2651#L367 assume !(main_~length~0#1 < 1); 2645#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2646#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2647#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2652#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2667#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2653#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2654#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2659#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2660#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2666#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2665#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2664#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2656#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2657#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2661#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2662#L370-4 main_~j~0#1 := 0; 2672#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2650#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2649#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2655#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2671#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2670#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2669#L378-2 [2022-02-21 03:35:26,606 INFO L793 eck$LassoCheckResult]: Loop: 2669#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2668#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2669#L378-2 [2022-02-21 03:35:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996711, now seen corresponding path program 3 times [2022-02-21 03:35:26,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118183181] [2022-02-21 03:35:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,649 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-02-21 03:35:26,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120725439] [2022-02-21 03:35:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,660 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -146740630, now seen corresponding path program 3 times [2022-02-21 03:35:26,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66607882] [2022-02-21 03:35:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:26,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:26,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:26,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:26,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2781#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:26,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {2781#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} is VALID [2022-02-21 03:35:26,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} is VALID [2022-02-21 03:35:26,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} main_~j~0#1 := 0; {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2786#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2787#(= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:26,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {2787#(= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:26,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:26,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66607882] [2022-02-21 03:35:26,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66607882] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:26,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017883737] [2022-02-21 03:35:26,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:35:26,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,813 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-21 03:35:26,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:35:26,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:26,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:27,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:35:27,863 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-21 03:35:27,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-02-21 03:35:27,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:27,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:27,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:27,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:27,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:27,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:27,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:27,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:27,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:27,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:27,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:27,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:27,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2840#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 3))} is VALID [2022-02-21 03:35:27,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 3))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2844#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1))))} is VALID [2022-02-21 03:35:27,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1))))} assume !(main_~i~0#1 < main_~length~0#1); {2848#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3)))} is VALID [2022-02-21 03:35:27,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3)))} main_~j~0#1 := 0; {2852#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2852#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2859#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {2859#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2859#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {2859#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2866#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {2866#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2866#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {2866#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2873#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:27,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {2873#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2877#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:27,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {2877#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:27,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:28,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-21 03:35:28,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-02-21 03:35:29,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {2877#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:29,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {2884#(or (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2877#(<= 0 |ULTIMATE.start_main_#t~mem210#1|)} is VALID [2022-02-21 03:35:29,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2884#(or (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-21 03:35:29,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} is VALID [2022-02-21 03:35:29,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} is VALID [2022-02-21 03:35:29,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|))))} is VALID [2022-02-21 03:35:29,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|))))} assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|))))} is VALID [2022-02-21 03:35:29,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|))))} is VALID [2022-02-21 03:35:29,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {2909#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} main_~j~0#1 := 0; {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|))))} is VALID [2022-02-21 03:35:29,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {2913#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~j~0#1_80|)))} assume !(main_~i~0#1 < main_~length~0#1); {2909#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} is VALID [2022-02-21 03:35:29,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {2917#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2913#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4)))) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~j~0#1_80|)))} is VALID [2022-02-21 03:35:29,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2917#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))))))} is VALID [2022-02-21 03:35:29,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:29,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:29,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:29,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:29,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:29,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017883737] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:29,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:29,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-02-21 03:35:29,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681976065] [2022-02-21 03:35:29,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:29,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:35:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:35:29,079 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,615 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 03:35:29,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:29,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2022-02-21 03:35:29,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:29,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 65 transitions. [2022-02-21 03:35:29,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 03:35:29,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 03:35:29,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2022-02-21 03:35:29,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:29,668 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-21 03:35:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2022-02-21 03:35:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-02-21 03:35:29,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:29,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,669 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,669 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,670 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:35:29,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states and 65 transitions. [2022-02-21 03:35:29,670 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states and 65 transitions. [2022-02-21 03:35:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,671 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:35:29,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:29,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2022-02-21 03:35:29,672 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-02-21 03:35:29,672 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-02-21 03:35:29,672 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2022-02-21 03:35:29,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-02-21 03:35:29,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:29,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,673 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:29,673 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:29,673 INFO L791 eck$LassoCheckResult]: Stem: 3048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3056#L367 assume !(main_~length~0#1 < 1); 3050#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3051#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3052#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3057#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3060#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3068#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3069#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3072#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3071#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3070#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3061#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3058#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3059#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3086#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3085#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3053#L370-4 main_~j~0#1 := 0; 3054#L378-2 [2022-02-21 03:35:29,673 INFO L793 eck$LassoCheckResult]: Loop: 3054#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3055#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3054#L378-2 [2022-02-21 03:35:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -49062696, now seen corresponding path program 2 times [2022-02-21 03:35:29,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456107542] [2022-02-21 03:35:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,696 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-02-21 03:35:29,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033380865] [2022-02-21 03:35:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,705 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 95390749, now seen corresponding path program 4 times [2022-02-21 03:35:29,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416513688] [2022-02-21 03:35:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,734 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,441 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:30,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:30,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:30,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:30,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:30,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:30,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:30,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration14_Lasso [2022-02-21 03:35:30,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:30,448 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:30,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,508 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:35:30,522 INFO L158 Benchmark]: Toolchain (without parser) took 65654.76ms. Allocated memory was 86.0MB in the beginning and 163.6MB in the end (delta: 77.6MB). Free memory was 50.7MB in the beginning and 121.0MB in the end (delta: -70.3MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:30,522 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:30,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.09ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 50.6MB in the beginning and 79.3MB in the end (delta: -28.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:30,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.44ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 77.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:30,523 INFO L158 Benchmark]: Boogie Preprocessor took 14.66ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 76.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:30,523 INFO L158 Benchmark]: RCFGBuilder took 343.39ms. Allocated memory is still 113.2MB. Free memory was 76.1MB in the beginning and 64.6MB in the end (delta: 11.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:30,523 INFO L158 Benchmark]: BuchiAutomizer took 64882.73ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 64.6MB in the beginning and 121.0MB in the end (delta: -56.4MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:30,524 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.09ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 50.6MB in the beginning and 79.3MB in the end (delta: -28.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.44ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 77.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.66ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 76.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.39ms. Allocated memory is still 113.2MB. Free memory was 76.1MB in the beginning and 64.6MB in the end (delta: 11.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 64882.73ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 64.6MB in the beginning and 121.0MB in the end (delta: -56.4MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:35:30,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-21 03:35:30,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-21 03:35:32,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:32,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:32,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:32,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!