./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/array-industry-pattern/array_assert_loop_dep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:07:10,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:07:10,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:07:10,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:07:10,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:07:10,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:07:10,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:07:10,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:07:10,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:07:10,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:07:10,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:07:10,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:07:10,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:07:10,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:07:10,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:07:10,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:07:10,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:07:10,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:07:10,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:07:10,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:07:10,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:07:10,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:07:10,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:07:10,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:07:10,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:07:10,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:07:10,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:07:10,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:07:10,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:07:10,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:07:10,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:07:10,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:07:10,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:07:10,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:07:10,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:07:10,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:07:10,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:07:10,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:07:10,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:07:10,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:07:10,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:07:10,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:07:10,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:07:10,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:07:10,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:07:10,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:07:10,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:07:10,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:07:10,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:07:10,416 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:07:10,417 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:07:10,417 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:07:10,417 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:07:10,417 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:07:10,418 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:07:10,418 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:07:10,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:07:10,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:07:10,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:07:10,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:07:10,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:07:10,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:07:10,420 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:07:10,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:07:10,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:07:10,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:07:10,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:07:10,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:07:10,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:07:10,422 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:07:10,423 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2022-07-14 15:07:10,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:07:10,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:07:10,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:07:10,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:07:10,708 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:07:10,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-07-14 15:07:10,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff66cf70a/faaf8b67b68546c7855a50d26fb79f7a/FLAGce59923b7 [2022-07-14 15:07:11,155 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:07:11,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-07-14 15:07:11,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff66cf70a/faaf8b67b68546c7855a50d26fb79f7a/FLAGce59923b7 [2022-07-14 15:07:11,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff66cf70a/faaf8b67b68546c7855a50d26fb79f7a [2022-07-14 15:07:11,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:07:11,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:07:11,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:07:11,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:07:11,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:07:11,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75329d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11, skipping insertion in model container [2022-07-14 15:07:11,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:07:11,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:07:11,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-07-14 15:07:11,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:11,343 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:07:11,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-07-14 15:07:11,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:11,377 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:07:11,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11 WrapperNode [2022-07-14 15:07:11,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:07:11,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:11,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:07:11,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:07:11,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,407 INFO L137 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2022-07-14 15:07:11,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:11,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:07:11,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:07:11,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:07:11,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:07:11,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:07:11,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:07:11,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:07:11,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (1/1) ... [2022-07-14 15:07:11,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:11,477 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-07-14 15:07:11,482 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-07-14 15:07:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:07:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:07:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:07:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:07:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:07:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:07:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:07:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:07:11,553 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:07:11,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:07:11,634 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:07:11,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:07:11,639 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:07:11,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:11 BoogieIcfgContainer [2022-07-14 15:07:11,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:07:11,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:07:11,641 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:07:11,644 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:07:11,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:11,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:07:11" (1/3) ... [2022-07-14 15:07:11,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bb835fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:11, skipping insertion in model container [2022-07-14 15:07:11,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:11,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:11" (2/3) ... [2022-07-14 15:07:11,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bb835fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:11, skipping insertion in model container [2022-07-14 15:07:11,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:11,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:11" (3/3) ... [2022-07-14 15:07:11,648 INFO L354 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2022-07-14 15:07:11,697 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:07:11,697 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:07:11,697 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:07:11,697 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:07:11,698 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:07:11,698 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:07:11,698 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:07:11,699 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:07:11,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:11,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:07:11,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:11,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:11,727 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:07:11,727 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:11,727 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:07:11,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:11,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:07:11,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:11,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:11,732 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:07:11,732 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:11,738 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L18-3true [2022-07-14 15:07:11,738 INFO L754 eck$LassoCheckResult]: Loop: 12#L18-3true assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 11#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 12#L18-3true [2022-07-14 15:07:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:07:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:11,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948225248] [2022-07-14 15:07:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:11,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:11,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 15:07:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:11,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450660386] [2022-07-14 15:07:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:11,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:11,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 15:07:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019765692] [2022-07-14 15:07:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:11,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:12,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:12,319 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:12,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:12,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:12,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:12,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:12,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:12,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:12,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:12,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2022-07-14 15:07:12,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:12,321 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:12,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:12,741 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:12,744 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:12,763 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-07-14 15:07:12,771 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-07-14 15:07:12,778 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-07-14 15:07:12,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:12,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:12,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:12,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:12,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:12,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:12,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:12,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:12,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:12,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:12,844 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-07-14 15:07:12,852 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-07-14 15:07:12,853 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-07-14 15:07:12,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:12,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:12,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:12,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:12,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:12,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:12,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:12,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:12,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:12,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:12,913 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-07-14 15:07:12,923 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-07-14 15:07:12,936 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-07-14 15:07:12,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:12,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:12,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:12,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:12,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:12,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:12,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:12,987 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-07-14 15:07:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:12,990 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-07-14 15:07:12,991 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-07-14 15:07:12,992 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-07-14 15:07:13,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:13,049 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-07-14 15:07:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,053 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-07-14 15:07:13,058 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-07-14 15:07:13,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,068 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-07-14 15:07:13,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:13,104 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-07-14 15:07:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,106 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-07-14 15:07:13,109 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-07-14 15:07:13,110 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-07-14 15:07:13,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:13,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,164 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-07-14 15:07:13,174 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-07-14 15:07:13,175 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-07-14 15:07:13,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:13,223 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-07-14 15:07:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,225 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-07-14 15:07:13,227 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-07-14 15:07:13,256 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-07-14 15:07:13,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:13,295 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-07-14 15:07:13,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,296 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-07-14 15:07:13,297 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-07-14 15:07:13,309 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-07-14 15:07:13,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:13,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:13,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:13,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:13,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:13,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:13,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:07:13,364 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-14 15:07:13,364 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-14 15:07:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:13,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,375 INFO L229 MonitoredProcess]: Starting monitored process 11 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-07-14 15:07:13,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:07:13,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:07:13,421 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:07:13,422 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:07:13,422 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-07-14 15:07:13,447 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-07-14 15:07:13,474 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-14 15:07:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:13,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:07:13,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:13,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:13,580 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-07-14 15:07:13,581 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:13,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 29 states and 41 transitions. Complement of second has 8 states. [2022-07-14 15:07:13,614 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-07-14 15:07:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-14 15:07:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 15:07:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 15:07:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 15:07:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:13,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2022-07-14 15:07:13,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:07:13,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2022-07-14 15:07:13,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-14 15:07:13,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-14 15:07:13,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-07-14 15:07:13,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:13,627 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-14 15:07:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-07-14 15:07:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-14 15:07:13,644 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-07-14 15:07:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-14 15:07:13,646 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-14 15:07:13,646 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-14 15:07:13,646 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:07:13,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-07-14 15:07:13,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:07:13,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:13,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:13,647 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:07:13,647 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:07:13,647 INFO L752 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 111#L18-3 assume !(main_~i~0#1 < 100000); 112#L18-4 main_~i~0#1 := 0; 113#L22-3 [2022-07-14 15:07:13,647 INFO L754 eck$LassoCheckResult]: Loop: 113#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 106#L13 assume !(0 == __VERIFIER_assert_~cond#1); 105#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 114#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 115#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 113#L22-3 [2022-07-14 15:07:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-14 15:07:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203976542] [2022-07-14 15:07:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:13,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203976542] [2022-07-14 15:07:13,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203976542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:13,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:13,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49221729] [2022-07-14 15:07:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:13,688 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2022-07-14 15:07:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:13,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397918257] [2022-07-14 15:07:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:13,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:13,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:13,853 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:13,874 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-07-14 15:07:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:13,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-07-14 15:07:13,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:07:13,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2022-07-14 15:07:13,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-14 15:07:13,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-14 15:07:13,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-07-14 15:07:13,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:13,881 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-14 15:07:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-07-14 15:07:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-07-14 15:07:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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-07-14 15:07:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-14 15:07:13,885 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-14 15:07:13,885 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-14 15:07:13,885 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:07:13,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-07-14 15:07:13,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:07:13,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:13,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:13,888 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:13,888 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:07:13,888 INFO L752 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 147#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 145#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 146#L18-3 assume !(main_~i~0#1 < 100000); 148#L18-4 main_~i~0#1 := 0; 149#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 155#L13 assume !(0 == __VERIFIER_assert_~cond#1); 154#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 150#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 151#L22-2 [2022-07-14 15:07:13,889 INFO L754 eck$LassoCheckResult]: Loop: 151#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 153#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 141#L13 assume !(0 == __VERIFIER_assert_~cond#1); 142#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 152#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 151#L22-2 [2022-07-14 15:07:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2022-07-14 15:07:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145213328] [2022-07-14 15:07:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:13,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145213328] [2022-07-14 15:07:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145213328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009739433] [2022-07-14 15:07:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:13,940 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-07-14 15:07:13,966 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-07-14 15:07:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:13,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 15:07:13,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:13,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:14,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009739433] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:14,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:14,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 15:07:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206231864] [2022-07-14 15:07:14,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:14,056 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:14,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2022-07-14 15:07:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:14,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769049229] [2022-07-14 15:07:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:14,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:14,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:14,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:14,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:07:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:14,224 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-07-14 15:07:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:14,271 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-14 15:07:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:07:14,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2022-07-14 15:07:14,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:07:14,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2022-07-14 15:07:14,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-14 15:07:14,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-14 15:07:14,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2022-07-14 15:07:14,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:14,275 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-14 15:07:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2022-07-14 15:07:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-07-14 15:07:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-07-14 15:07:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-14 15:07:14,278 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 15:07:14,278 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 15:07:14,278 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:07:14,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-07-14 15:07:14,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:07:14,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:14,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:14,280 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-14 15:07:14,280 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:07:14,280 INFO L752 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 259#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 260#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 261#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 257#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 258#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 271#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 270#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 269#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 268#L18-3 assume !(main_~i~0#1 < 100000); 262#L18-4 main_~i~0#1 := 0; 263#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 255#L13 assume !(0 == __VERIFIER_assert_~cond#1); 256#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 266#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 275#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 276#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 278#L13 assume !(0 == __VERIFIER_assert_~cond#1); 277#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 264#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 265#L22-2 [2022-07-14 15:07:14,281 INFO L754 eck$LassoCheckResult]: Loop: 265#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 267#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 274#L13 assume !(0 == __VERIFIER_assert_~cond#1); 273#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 272#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 265#L22-2 [2022-07-14 15:07:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2022-07-14 15:07:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:14,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16812414] [2022-07-14 15:07:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:07:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:14,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16812414] [2022-07-14 15:07:14,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16812414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407123626] [2022-07-14 15:07:14,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:14,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:14,336 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-07-14 15:07:14,377 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-07-14 15:07:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:14,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:14,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:07:14,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 15:07:14,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407123626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:14,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:14,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 15:07:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221283530] [2022-07-14 15:07:14,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:14,471 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2022-07-14 15:07:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601838911] [2022-07-14 15:07:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:14,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:14,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:07:14,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:07:14,616 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:14,728 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-07-14 15:07:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:07:14,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2022-07-14 15:07:14,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-07-14 15:07:14,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2022-07-14 15:07:14,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-14 15:07:14,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-14 15:07:14,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2022-07-14 15:07:14,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:14,733 INFO L369 hiAutomatonCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-07-14 15:07:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2022-07-14 15:07:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-07-14 15:07:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-14 15:07:14,738 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-14 15:07:14,738 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-14 15:07:14,738 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:07:14,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2022-07-14 15:07:14,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:07:14,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:14,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:14,740 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2022-07-14 15:07:14,740 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:07:14,741 INFO L752 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 491#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 496#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 498#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 494#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 495#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 521#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 520#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 518#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 516#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 514#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 512#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 510#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 508#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 507#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 506#L18-3 assume !(main_~i~0#1 < 100000); 499#L18-4 main_~i~0#1 := 0; 500#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 504#L13 assume !(0 == __VERIFIER_assert_~cond#1); 542#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 541#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 525#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 526#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 492#L13 assume !(0 == __VERIFIER_assert_~cond#1); 493#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 503#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 527#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 540#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 539#L13 assume !(0 == __VERIFIER_assert_~cond#1); 538#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 537#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 536#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 535#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 534#L13 assume !(0 == __VERIFIER_assert_~cond#1); 533#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 532#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 531#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 530#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 529#L13 assume !(0 == __VERIFIER_assert_~cond#1); 528#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 501#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 502#L22-2 [2022-07-14 15:07:14,741 INFO L754 eck$LassoCheckResult]: Loop: 502#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 505#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 524#L13 assume !(0 == __VERIFIER_assert_~cond#1); 523#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 522#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 502#L22-2 [2022-07-14 15:07:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2022-07-14 15:07:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093712542] [2022-07-14 15:07:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 15:07:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093712542] [2022-07-14 15:07:14,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093712542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191288934] [2022-07-14 15:07:14,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:14,918 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-07-14 15:07:14,920 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-07-14 15:07:14,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:07:14,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:14,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:07:15,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 15:07:15,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-14 15:07:15,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191288934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:15,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:15,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-14 15:07:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082369817] [2022-07-14 15:07:15,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:15,234 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2022-07-14 15:07:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022617284] [2022-07-14 15:07:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:15,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:15,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 15:07:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-14 15:07:15,355 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:15,566 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-07-14 15:07:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 15:07:15,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-07-14 15:07:15,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-07-14 15:07:15,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2022-07-14 15:07:15,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-07-14 15:07:15,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-07-14 15:07:15,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2022-07-14 15:07:15,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:15,571 INFO L369 hiAutomatonCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-07-14 15:07:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2022-07-14 15:07:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2022-07-14 15:07:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-07-14 15:07:15,578 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-07-14 15:07:15,579 INFO L374 stractBuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-07-14 15:07:15,579 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:07:15,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2022-07-14 15:07:15,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:07:15,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:15,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:15,582 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2022-07-14 15:07:15,582 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:07:15,583 INFO L752 eck$LassoCheckResult]: Stem: 1012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 1013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1018#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1019#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1020#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1016#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1017#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1067#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1066#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1065#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1064#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1063#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1062#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1061#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1060#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1059#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1058#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1057#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1056#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1055#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1054#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1053#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1052#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1051#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1050#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1049#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1048#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1047#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1046#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1045#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1044#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1043#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1042#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1041#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1040#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1039#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1038#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1037#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1036#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1035#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1034#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1033#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1032#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1031#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1030#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1029#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1028#L18-3 assume !(main_~i~0#1 < 100000); 1021#L18-4 main_~i~0#1 := 0; 1022#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1026#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1118#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1117#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1071#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1072#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1014#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1015#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1025#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1073#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1116#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1115#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1114#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1113#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1112#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1111#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1110#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1109#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1108#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1107#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1106#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1105#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1104#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1103#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1102#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1101#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1100#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1099#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1098#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1097#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1096#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1095#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1094#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1093#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1092#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1091#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1090#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1089#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1088#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1087#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1086#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1085#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1084#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1083#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1082#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1081#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1080#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1079#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1078#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1077#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1076#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1075#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1074#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1023#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1024#L22-2 [2022-07-14 15:07:15,583 INFO L754 eck$LassoCheckResult]: Loop: 1024#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1027#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1070#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1069#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1068#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1024#L22-2 [2022-07-14 15:07:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2022-07-14 15:07:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:15,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000256875] [2022-07-14 15:07:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-14 15:07:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000256875] [2022-07-14 15:07:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000256875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621603798] [2022-07-14 15:07:15,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:07:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:15,999 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-07-14 15:07:16,023 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-07-14 15:07:16,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 15:07:16,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:16,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 15:07:16,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:16,122 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 16 treesize of output 12 [2022-07-14 15:07:16,178 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 23 treesize of output 7 [2022-07-14 15:07:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-07-14 15:07:16,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:07:16,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621603798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:16,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:07:16,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2022-07-14 15:07:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227236777] [2022-07-14 15:07:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:16,206 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2022-07-14 15:07:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397791362] [2022-07-14 15:07:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:16,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:16,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:07:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2022-07-14 15:07:16,334 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-07-14 15:07:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:16,367 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-07-14 15:07:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:07:16,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2022-07-14 15:07:16,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:07:16,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-07-14 15:07:16,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:07:16,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:07:16,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:07:16,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:16,368 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:07:16,368 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:07:16,368 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:07:16,369 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:07:16,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:07:16,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:07:16,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:07:16,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:07:16 BoogieIcfgContainer [2022-07-14 15:07:16,375 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:07:16,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:07:16,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:07:16,375 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:07:16,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:11" (3/4) ... [2022-07-14 15:07:16,384 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:07:16,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:07:16,385 INFO L158 Benchmark]: Toolchain (without parser) took 5210.28ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 80.5MB in the beginning and 46.7MB in the end (delta: 33.9MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2022-07-14 15:07:16,385 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:07:16,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.51ms. Allocated memory is still 111.1MB. Free memory was 80.5MB in the beginning and 87.2MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:07:16,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 111.1MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:07:16,386 INFO L158 Benchmark]: Boogie Preprocessor took 37.29ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:07:16,387 INFO L158 Benchmark]: RCFGBuilder took 194.10ms. Allocated memory is still 111.1MB. Free memory was 84.8MB in the beginning and 75.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:07:16,387 INFO L158 Benchmark]: BuchiAutomizer took 4733.38ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 74.8MB in the beginning and 46.7MB in the end (delta: 28.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-07-14 15:07:16,387 INFO L158 Benchmark]: Witness Printer took 8.98ms. Allocated memory is still 134.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:07:16,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.51ms. Allocated memory is still 111.1MB. Free memory was 80.5MB in the beginning and 87.2MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 111.1MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.29ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 194.10ms. Allocated memory is still 111.1MB. Free memory was 84.8MB in the beginning and 75.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4733.38ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 74.8MB in the beginning and 46.7MB in the end (delta: 28.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 8.98ms. Allocated memory is still 134.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 3.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 39 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp95 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:07:16,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-14 15:07:16,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:16,834 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-07-14 15:07:17,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 15:07:17,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE