./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:46:43,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:46:43,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:46:43,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:46:43,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:46:43,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:46:43,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:46:43,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:46:43,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:46:43,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:46:43,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:46:43,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:46:43,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:46:43,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:46:43,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:46:43,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:46:43,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:46:43,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:46:43,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:46:43,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:46:43,308 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:46:43,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:46:43,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:46:43,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:46:43,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:46:43,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:46:43,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:46:43,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:46:43,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:46:43,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:46:43,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:46:43,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:46:43,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:46:43,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:46:43,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:46:43,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:46:43,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:46:43,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:46:43,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:46:43,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:46:43,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:46:43,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:46:43,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:46:43,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:46:43,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:46:43,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:46:43,351 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:46:43,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:46:43,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:46:43,352 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:46:43,352 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:46:43,353 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:46:43,353 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:46:43,353 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:46:43,354 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:46:43,354 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:46:43,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:46:43,354 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:46:43,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:46:43,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:46:43,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:46:43,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:46:43,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:46:43,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:46:43,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:46:43,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:46:43,358 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:46:43,358 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2022-07-14 14:46:43,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:46:43,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:46:43,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:46:43,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:46:43,572 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:46:43,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-07-14 14:46:43,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d4de88/c29952afd21b4e798fb8cab67457564a/FLAGd19048eaa [2022-07-14 14:46:43,974 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:46:43,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-07-14 14:46:43,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d4de88/c29952afd21b4e798fb8cab67457564a/FLAGd19048eaa [2022-07-14 14:46:43,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d4de88/c29952afd21b4e798fb8cab67457564a [2022-07-14 14:46:43,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:46:43,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:46:43,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:46:44,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:46:44,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:46:44,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:46:43" (1/1) ... [2022-07-14 14:46:44,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c8de33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44, skipping insertion in model container [2022-07-14 14:46:44,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:46:43" (1/1) ... [2022-07-14 14:46:44,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:46:44,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:46:44,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:46:44,172 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:46:44,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:46:44,196 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:46:44,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44 WrapperNode [2022-07-14 14:46:44,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:46:44,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:46:44,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:46:44,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:46:44,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,221 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-07-14 14:46:44,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:46:44,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:46:44,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:46:44,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:46:44,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:46:44,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:46:44,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:46:44,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:46:44,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (1/1) ... [2022-07-14 14:46:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:46:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:46:44,301 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 14:46:44,317 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 14:46:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:46:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:46:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:46:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:46:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:46:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:46:44,388 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:46:44,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:46:44,475 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:46:44,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:46:44,489 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 14:46:44,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:46:44 BoogieIcfgContainer [2022-07-14 14:46:44,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:46:44,492 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:46:44,492 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:46:44,495 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:46:44,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:46:44,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:46:43" (1/3) ... [2022-07-14 14:46:44,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b7308f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:46:44, skipping insertion in model container [2022-07-14 14:46:44,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:46:44,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:46:44" (2/3) ... [2022-07-14 14:46:44,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b7308f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:46:44, skipping insertion in model container [2022-07-14 14:46:44,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:46:44,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:46:44" (3/3) ... [2022-07-14 14:46:44,498 INFO L354 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2022-07-14 14:46:44,558 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:46:44,574 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:46:44,575 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:46:44,575 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:46:44,575 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:46:44,575 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:46:44,575 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:46:44,575 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:46:44,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:46:44,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 14:46:44,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:44,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:44,592 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:46:44,592 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:46:44,592 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:46:44,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:46:44,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 14:46:44,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:44,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:44,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:46:44,594 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:46:44,598 INFO L752 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 8#L13-3true [2022-07-14 14:46:44,598 INFO L754 eck$LassoCheckResult]: Loop: 8#L13-3true assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 7#L13-2true main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 8#L13-3true [2022-07-14 14:46:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 14:46:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:44,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496186429] [2022-07-14 14:46:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 14:46:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:44,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761531446] [2022-07-14 14:46:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 14:46:44,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:44,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447686303] [2022-07-14 14:46:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:44,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:44,850 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:46:44,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:46:44,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:46:44,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:46:44,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:46:44,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:46:44,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:46:44,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:46:44,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2022-07-14 14:46:44,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:46:44,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:46:44,863 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 14:46:44,940 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 14:46:44,946 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 14:46:44,948 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 14:46:44,950 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 14:46:44,951 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 14:46:44,953 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 14:46:44,955 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 14:46:44,957 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 14:46:44,959 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 14:46:45,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:46:45,107 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:46:45,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:46:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:46:45,109 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 14:46:45,114 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 14:46:45,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:46:45,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:46:45,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:46:45,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:46:45,124 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 14:46:45,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:46:45,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:46:45,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:46:45,169 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 14:46:45,169 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-14 14:46:45,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:46:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:46:45,188 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 14:46:45,189 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 14:46:45,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:46:45,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:46:45,213 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:46:45,213 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~n~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-07-14 14:46:45,230 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 14:46:45,235 INFO L293 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-07-14 14:46:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:46:45,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:46:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:46:45,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:46:45,293 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 14:46:45,311 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 14:46:45,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 14:46:45,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 25 states and 37 transitions. Complement of second has 8 states. [2022-07-14 14:46:45,342 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 14:46:45,345 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 14:46:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-14 14:46:45,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 14:46:45,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:46:45,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 14:46:45,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:46:45,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 14:46:45,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:46:45,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. [2022-07-14 14:46:45,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2022-07-14 14:46:45,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 14:46:45,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 14:46:45,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-07-14 14:46:45,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:46:45,352 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-14 14:46:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-07-14 14:46:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-14 14:46:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:46:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-07-14 14:46:45,366 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-14 14:46:45,366 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-14 14:46:45,366 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:46:45,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-07-14 14:46:45,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:45,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:45,367 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:46:45,367 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:46:45,368 INFO L752 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 87#L13-3 assume !(main_~n~0#1 < 10); 82#L17-4 [2022-07-14 14:46:45,368 INFO L754 eck$LassoCheckResult]: Loop: 82#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 80#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 81#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 82#L17-4 [2022-07-14 14:46:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-07-14 14:46:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:45,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151213549] [2022-07-14 14:46:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,390 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 14:46:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:46:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151213549] [2022-07-14 14:46:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151213549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:46:45,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:46:45,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:46:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106122698] [2022-07-14 14:46:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:46:45,393 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:46:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2022-07-14 14:46:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772269428] [2022-07-14 14:46:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:45,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:45,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:46:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:46:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:46:45,504 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 14:46:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:46:45,511 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-07-14 14:46:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:46:45,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2022-07-14 14:46:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2022-07-14 14:46:45,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 14:46:45,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 14:46:45,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-07-14 14:46:45,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:46:45,513 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-14 14:46:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-07-14 14:46:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-14 14:46:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:46:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-14 14:46:45,515 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 14:46:45,515 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 14:46:45,515 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:46:45,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-14 14:46:45,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:45,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:45,516 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 14:46:45,516 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:46:45,516 INFO L752 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 110#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 108#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 109#L13-3 assume !(main_~n~0#1 < 10); 105#L17-4 [2022-07-14 14:46:45,516 INFO L754 eck$LassoCheckResult]: Loop: 105#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 103#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 104#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 105#L17-4 [2022-07-14 14:46:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-07-14 14:46:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:45,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208500349] [2022-07-14 14:46:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,535 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 14:46:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:46:45,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208500349] [2022-07-14 14:46:45,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208500349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:46:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370473270] [2022-07-14 14:46:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:46:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:46:45,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:46:45,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 14:46:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:46:45,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:46:45,637 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 14:46:45,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:46:45,645 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 14:46:45,662 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 14:46:45,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370473270] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:46:45,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:46:45,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-14 14:46:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164248248] [2022-07-14 14:46:45,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:46:45,666 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:46:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2022-07-14 14:46:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:45,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598375956] [2022-07-14 14:46:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:45,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:45,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:46:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:46:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:46:45,801 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 14:46:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:46:45,820 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-07-14 14:46:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:46:45,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2022-07-14 14:46:45,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2022-07-14 14:46:45,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 14:46:45,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 14:46:45,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-14 14:46:45,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:46:45,825 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-14 14:46:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-14 14:46:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 14:46:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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 14:46:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-14 14:46:45,827 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-14 14:46:45,827 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-14 14:46:45,827 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:46:45,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-07-14 14:46:45,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:45,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:45,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:45,830 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-07-14 14:46:45,830 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:46:45,831 INFO L752 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 166#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 167#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 168#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 164#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 165#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 172#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 171#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 170#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 169#L13-3 assume !(main_~n~0#1 < 10); 161#L17-4 [2022-07-14 14:46:45,831 INFO L754 eck$LassoCheckResult]: Loop: 161#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 159#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 160#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 161#L17-4 [2022-07-14 14:46:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-07-14 14:46:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:45,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001439044] [2022-07-14 14:46:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:46:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:46:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:46:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001439044] [2022-07-14 14:46:45,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001439044] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:46:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233391808] [2022-07-14 14:46:45,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:46:45,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:46:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:46:45,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:46:45,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 14:46:45,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:46:45,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:46:45,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:46:45,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:46:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:46:45,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:46:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:46:45,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233391808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:46:45,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:46:45,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-14 14:46:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236485613] [2022-07-14 14:46:45,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:46:46,000 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:46:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2022-07-14 14:46:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:46,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943180193] [2022-07-14 14:46:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:46:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 14:46:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:46:46,096 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 14:46:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:46:46,147 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-07-14 14:46:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:46:46,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2022-07-14 14:46:46,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:46,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2022-07-14 14:46:46,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 14:46:46,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 14:46:46,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-07-14 14:46:46,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:46:46,152 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 14:46:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-07-14 14:46:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-14 14:46:46,154 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 14:46:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-14 14:46:46,155 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 14:46:46,155 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-14 14:46:46,155 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:46:46,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-07-14 14:46:46,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:46:46,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:46:46,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:46:46,157 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-07-14 14:46:46,157 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:46:46,157 INFO L752 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 282#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 283#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 284#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 280#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 281#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 300#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 299#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 298#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 297#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 296#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 295#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 294#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 293#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 292#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 291#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 290#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 289#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 288#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 287#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 286#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 285#L13-3 assume !(main_~n~0#1 < 10); 277#L17-4 [2022-07-14 14:46:46,157 INFO L754 eck$LassoCheckResult]: Loop: 277#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 275#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 276#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L17-4 [2022-07-14 14:46:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-07-14 14:46:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767407872] [2022-07-14 14:46:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2022-07-14 14:46:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:46,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407805900] [2022-07-14 14:46:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:46,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:46:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2022-07-14 14:46:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:46:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235575782] [2022-07-14 14:46:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:46:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:46:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:46:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:46:46,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:46:48,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:46:48 BoogieIcfgContainer [2022-07-14 14:46:48,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:46:48,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:46:48,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:46:48,919 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:46:48,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:46:44" (3/4) ... [2022-07-14 14:46:48,921 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 14:46:48,971 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 14:46:48,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:46:48,972 INFO L158 Benchmark]: Toolchain (without parser) took 4975.00ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 91.9MB in the beginning and 91.1MB in the end (delta: 825.5kB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,972 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:46:48,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 98.9MB in the end (delta: -7.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.98ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,974 INFO L158 Benchmark]: Boogie Preprocessor took 23.29ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:46:48,974 INFO L158 Benchmark]: RCFGBuilder took 245.35ms. Allocated memory is still 123.7MB. Free memory was 96.7MB in the beginning and 87.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,974 INFO L158 Benchmark]: BuchiAutomizer took 4422.56ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 87.3MB in the beginning and 93.2MB in the end (delta: -5.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,975 INFO L158 Benchmark]: Witness Printer took 56.28ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:46:48,977 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.16ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 98.9MB in the end (delta: -7.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.98ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 97.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.29ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 245.35ms. Allocated memory is still 123.7MB. Free memory was 96.7MB in the beginning and 87.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4422.56ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 87.3MB in the beginning and 93.2MB in the end (delta: -5.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * Witness Printer took 56.28ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -8 * n + 19 * unknown-#length-unknown[a] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 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, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp65 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 105ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bd6cfad=8, NULL=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@483c7c9c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@7f1b5288=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@cd8d20a=0, NULL=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@af666f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@13e8bdea=0, i=8, NULL=0, n=10, a=2} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 14:46:49,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:46:49,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:46:49,420 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)