./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/loop-invgen/id_build.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 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:49:35,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:49:35,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:49:35,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:49:35,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:49:35,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:49:35,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:49:35,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:49:35,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:49:35,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:49:35,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:49:35,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:49:35,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:49:35,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:49:35,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:49:35,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:49:35,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:49:35,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:49:35,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:49:35,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:49:35,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:49:35,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:49:35,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:49:35,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:49:35,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:49:35,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:49:35,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:49:35,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:49:35,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:49:35,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:49:35,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:49:35,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:49:35,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:49:35,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:49:35,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:49:35,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:49:35,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:49:35,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:49:35,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:49:35,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:49:35,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:49:35,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 09:49:35,387 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:49:35,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:49:35,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:49:35,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:49:35,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:49:35,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:49:35,389 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:49:35,389 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:49:35,389 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:49:35,389 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:49:35,389 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:49:35,390 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:49:35,390 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:49:35,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:49:35,390 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:49:35,390 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:49:35,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:49:35,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:49:35,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:49:35,397 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:49:35,398 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:49:35,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:49:35,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:49:35,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:49:35,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:49:35,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:49:35,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:49:35,400 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:49:35,400 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 -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2021-12-16 09:49:35,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:49:35,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:49:35,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:49:35,579 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:49:35,580 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:49:35,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2021-12-16 09:49:35,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3a389e8/09cede61f4d74b81a7c6ca4753bef31f/FLAG9e3d52d0a [2021-12-16 09:49:35,969 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:49:35,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2021-12-16 09:49:35,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3a389e8/09cede61f4d74b81a7c6ca4753bef31f/FLAG9e3d52d0a [2021-12-16 09:49:35,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3a389e8/09cede61f4d74b81a7c6ca4753bef31f [2021-12-16 09:49:35,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:49:35,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:49:35,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:49:35,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:49:35,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:49:35,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:49:35" (1/1) ... [2021-12-16 09:49:35,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3364394c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:35, skipping insertion in model container [2021-12-16 09:49:35,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:49:35" (1/1) ... [2021-12-16 09:49:36,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:49:36,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:49:36,141 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/loop-invgen/id_build.i[893,906] [2021-12-16 09:49:36,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:49:36,152 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:49:36,160 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/loop-invgen/id_build.i[893,906] [2021-12-16 09:49:36,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:49:36,170 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:49:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36 WrapperNode [2021-12-16 09:49:36,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:49:36,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:49:36,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:49:36,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:49:36,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,191 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2021-12-16 09:49:36,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:49:36,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:49:36,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:49:36,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:49:36,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:49:36,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:49:36,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:49:36,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:49:36,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (1/1) ... [2021-12-16 09:49:36,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:36,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:36,238 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) [2021-12-16 09:49:36,251 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 [2021-12-16 09:49:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:49:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:49:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:49:36,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:49:36,313 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:49:36,314 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:49:36,390 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:49:36,394 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:49:36,394 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:49:36,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:49:36 BoogieIcfgContainer [2021-12-16 09:49:36,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:49:36,396 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:49:36,396 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:49:36,398 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:49:36,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:49:36,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:49:35" (1/3) ... [2021-12-16 09:49:36,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c0114d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:49:36, skipping insertion in model container [2021-12-16 09:49:36,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:49:36,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:49:36" (2/3) ... [2021-12-16 09:49:36,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c0114d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:49:36, skipping insertion in model container [2021-12-16 09:49:36,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:49:36,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:49:36" (3/3) ... [2021-12-16 09:49:36,401 INFO L388 chiAutomizerObserver]: Analyzing ICFG id_build.i [2021-12-16 09:49:36,458 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:49:36,459 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:49:36,459 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:49:36,467 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:49:36,467 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:49:36,467 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:49:36,467 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:49:36,467 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:49:36,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:36,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-12-16 09:49:36,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:36,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:36,505 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:49:36,505 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:49:36,505 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:49:36,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:36,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-12-16 09:49:36,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:36,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:36,507 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:49:36,507 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:49:36,511 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 15#L27-3true [2021-12-16 09:49:36,511 INFO L793 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 16#L28-3true assume !(main_~j~0#1 < 8); 11#L27-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15#L27-3true [2021-12-16 09:49:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 09:49:36,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:36,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928589934] [2021-12-16 09:49:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:36,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:36,589 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 39941, now seen corresponding path program 1 times [2021-12-16 09:49:36,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:36,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89315355] [2021-12-16 09:49:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:36,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:49:36,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89315355] [2021-12-16 09:49:36,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89315355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:49:36,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:49:36,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:49:36,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11676759] [2021-12-16 09:49:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:49:36,635 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:49:36,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:49:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:49:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:49:36,662 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 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) [2021-12-16 09:49:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:49:36,681 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-12-16 09:49:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:49:36,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2021-12-16 09:49:36,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-12-16 09:49:36,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 17 transitions. [2021-12-16 09:49:36,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-16 09:49:36,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-16 09:49:36,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2021-12-16 09:49:36,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:49:36,699 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-16 09:49:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2021-12-16 09:49:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2021-12-16 09:49:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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) [2021-12-16 09:49:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-16 09:49:36,728 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-16 09:49:36,728 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-16 09:49:36,728 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:49:36,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-12-16 09:49:36,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-16 09:49:36,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:36,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:36,730 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:49:36,730 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:49:36,730 INFO L791 eck$LassoCheckResult]: Stem: 51#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(9, 2); 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 56#L27-3 [2021-12-16 09:49:36,731 INFO L793 eck$LassoCheckResult]: Loop: 56#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 57#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 53#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 54#L18-5 assume { :end_inline___VERIFIER_assert } true; 55#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 58#L28-3 assume !(main_~j~0#1 < 8); 59#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 56#L27-3 [2021-12-16 09:49:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-16 09:49:36,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439356554] [2021-12-16 09:49:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:36,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:36,767 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1762492053, now seen corresponding path program 1 times [2021-12-16 09:49:36,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:36,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129332003] [2021-12-16 09:49:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:36,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:49:36,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129332003] [2021-12-16 09:49:36,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129332003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:49:36,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389172985] [2021-12-16 09:49:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:49:36,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:36,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:49:36,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 09:49:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:36,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:49:36,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:36,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:49:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:36,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389172985] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:49:36,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:49:36,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-16 09:49:36,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54348232] [2021-12-16 09:49:36,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:49:36,949 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:49:36,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:49:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:49:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:49:36,951 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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) [2021-12-16 09:49:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:49:36,979 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-16 09:49:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:49:36,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-12-16 09:49:36,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-12-16 09:49:36,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-12-16 09:49:36,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-16 09:49:36,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-16 09:49:36,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-12-16 09:49:36,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:49:36,988 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-16 09:49:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-12-16 09:49:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-16 09:49:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 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) [2021-12-16 09:49:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-12-16 09:49:36,992 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-16 09:49:36,993 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-16 09:49:36,993 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:49:36,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2021-12-16 09:49:36,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-12-16 09:49:36,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:36,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:36,995 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:49:36,996 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 1, 1, 1] [2021-12-16 09:49:36,996 INFO L791 eck$LassoCheckResult]: Stem: 148#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(9, 2); 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 155#L27-3 [2021-12-16 09:49:36,996 INFO L793 eck$LassoCheckResult]: Loop: 155#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 156#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 147#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 154#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 152#L18-5 assume { :end_inline___VERIFIER_assert } true; 153#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 157#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 150#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 151#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 173#L18-5 assume { :end_inline___VERIFIER_assert } true; 172#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 171#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 169#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 168#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 167#L18-5 assume { :end_inline___VERIFIER_assert } true; 166#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 165#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 164#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 163#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 162#L18-5 assume { :end_inline___VERIFIER_assert } true; 161#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 159#L28-3 assume !(main_~j~0#1 < 8); 158#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 155#L27-3 [2021-12-16 09:49:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-16 09:49:36,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:36,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337087969] [2021-12-16 09:49:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:36,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,021 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1080615355, now seen corresponding path program 2 times [2021-12-16 09:49:37,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:37,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367018857] [2021-12-16 09:49:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:37,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:37,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:49:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367018857] [2021-12-16 09:49:37,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367018857] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:49:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221389403] [2021-12-16 09:49:37,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:49:37,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:49:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:37,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:49:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 09:49:37,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:49:37,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:49:37,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:49:37,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:37,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:49:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:37,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221389403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:49:37,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:49:37,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-16 09:49:37,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274674326] [2021-12-16 09:49:37,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:49:37,309 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:49:37,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:49:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 09:49:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-12-16 09:49:37,311 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:49:37,347 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2021-12-16 09:49:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 09:49:37,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 54 transitions. [2021-12-16 09:49:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-16 09:49:37,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 54 transitions. [2021-12-16 09:49:37,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-12-16 09:49:37,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-12-16 09:49:37,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 54 transitions. [2021-12-16 09:49:37,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:49:37,350 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-16 09:49:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 54 transitions. [2021-12-16 09:49:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-16 09:49:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 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) [2021-12-16 09:49:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-12-16 09:49:37,353 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-16 09:49:37,353 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-12-16 09:49:37,353 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:49:37,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 54 transitions. [2021-12-16 09:49:37,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-16 09:49:37,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:37,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:37,355 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:49:37,355 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 1, 1, 1] [2021-12-16 09:49:37,355 INFO L791 eck$LassoCheckResult]: Stem: 399#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(9, 2); 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 406#L27-3 [2021-12-16 09:49:37,355 INFO L793 eck$LassoCheckResult]: Loop: 406#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 407#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 398#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 405#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 403#L18-5 assume { :end_inline___VERIFIER_assert } true; 404#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 408#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 401#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 402#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 448#L18-5 assume { :end_inline___VERIFIER_assert } true; 447#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 446#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 444#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 443#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 442#L18-5 assume { :end_inline___VERIFIER_assert } true; 441#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 440#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 438#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 437#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 436#L18-5 assume { :end_inline___VERIFIER_assert } true; 435#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 434#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 433#L18 assume !(0 == __VERIFIER_assert_~cond#1); 432#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 431#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 430#L18-5 assume { :end_inline___VERIFIER_assert } true; 429#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 428#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 426#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 425#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 424#L18-5 assume { :end_inline___VERIFIER_assert } true; 423#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 422#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 421#L18 assume !(0 == __VERIFIER_assert_~cond#1); 420#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 419#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 418#L18-5 assume { :end_inline___VERIFIER_assert } true; 417#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 416#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 415#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 414#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 413#L18-5 assume { :end_inline___VERIFIER_assert } true; 412#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 410#L28-3 assume !(main_~j~0#1 < 8); 409#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 406#L27-3 [2021-12-16 09:49:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-16 09:49:37,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:37,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377510704] [2021-12-16 09:49:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:37,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash 811262085, now seen corresponding path program 3 times [2021-12-16 09:49:37,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:37,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604942545] [2021-12-16 09:49:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:37,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,395 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2018441603, now seen corresponding path program 1 times [2021-12-16 09:49:37,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051402386] [2021-12-16 09:49:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:37,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:37,431 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:37,926 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:37,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:37,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:37,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:37,927 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:49:37,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:37,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:37,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:37,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2021-12-16 09:49:37,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:37,928 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:37,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:37,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:37,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:37,996 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:37,996 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:49:37,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:37,999 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) [2021-12-16 09:49:38,000 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 [2021-12-16 09:49:38,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:38,013 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=8} Honda state: {ULTIMATE.start_main_~j~0#1=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:38,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-16 09:49:38,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,032 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) [2021-12-16 09:49:38,033 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 [2021-12-16 09:49:38,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,059 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:38,060 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:38,078 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 [2021-12-16 09:49:38,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,079 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) [2021-12-16 09:49:38,080 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 [2021-12-16 09:49:38,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,120 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 [2021-12-16 09:49:38,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,124 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) [2021-12-16 09:49:38,125 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 [2021-12-16 09:49:38,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:49:38,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,179 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:49:38,183 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 [2021-12-16 09:49:38,183 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:38,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:38,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:38,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:38,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:49:38,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:38,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:38,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2021-12-16 09:49:38,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:38,183 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:38,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,238 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:38,242 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:49:38,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,244 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) [2021-12-16 09:49:38,245 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 [2021-12-16 09:49:38,246 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 [2021-12-16 09:49:38,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:38,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:38,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:38,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:38,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:38,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:38,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:38,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:38,289 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 [2021-12-16 09:49:38,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,291 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) [2021-12-16 09:49:38,292 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 [2021-12-16 09:49:38,294 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 [2021-12-16 09:49:38,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:38,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:38,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:38,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:38,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:38,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:38,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:38,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:38,322 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 [2021-12-16 09:49:38,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,323 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) [2021-12-16 09:49:38,324 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 [2021-12-16 09:49:38,325 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 [2021-12-16 09:49:38,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:38,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:38,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:38,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:38,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:38,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:38,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:38,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:49:38,338 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:49:38,338 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:49:38,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,340 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) [2021-12-16 09:49:38,340 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 [2021-12-16 09:49:38,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:49:38,341 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:49:38,341 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:49:38,342 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nlen~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-16 09:49:38,359 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 [2021-12-16 09:49:38,360 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:49:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:38,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:49:38,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:38,406 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 [2021-12-16 09:49:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:38,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:49:38,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-12-16 09:49:38,680 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 [2021-12-16 09:49:38,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 54 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-16 09:49:38,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 54 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 104 states and 107 transitions. Complement of second has 4 states. [2021-12-16 09:49:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-16 09:49:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-16 09:49:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2021-12-16 09:49:38,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 51 letters. [2021-12-16 09:49:38,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:38,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 53 letters. Loop has 51 letters. [2021-12-16 09:49:38,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:38,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 102 letters. [2021-12-16 09:49:38,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:38,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 107 transitions. [2021-12-16 09:49:38,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-16 09:49:38,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 103 states and 106 transitions. [2021-12-16 09:49:38,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-16 09:49:38,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-12-16 09:49:38,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 106 transitions. [2021-12-16 09:49:38,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:49:38,707 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 106 transitions. [2021-12-16 09:49:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 106 transitions. [2021-12-16 09:49:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 60. [2021-12-16 09:49:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-12-16 09:49:38,710 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-12-16 09:49:38,710 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-12-16 09:49:38,710 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:49:38,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2021-12-16 09:49:38,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-16 09:49:38,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:38,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:38,713 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-16 09:49:38,713 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:49:38,713 INFO L791 eck$LassoCheckResult]: Stem: 737#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(9, 2); 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 746#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 748#L28-3 [2021-12-16 09:49:38,713 INFO L793 eck$LassoCheckResult]: Loop: 748#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 733#L18 assume !(0 == __VERIFIER_assert_~cond#1); 734#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 739#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 741#L18-5 assume { :end_inline___VERIFIER_assert } true; 742#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 748#L28-3 [2021-12-16 09:49:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2021-12-16 09:49:38,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:38,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717305316] [2021-12-16 09:49:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:38,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1426785425, now seen corresponding path program 1 times [2021-12-16 09:49:38,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:38,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897503850] [2021-12-16 09:49:38,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:38,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash -181476169, now seen corresponding path program 1 times [2021-12-16 09:49:38,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:38,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807616820] [2021-12-16 09:49:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:38,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:38,742 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:38,783 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:38,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:38,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:38,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:38,784 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:49:38,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:38,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:38,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2021-12-16 09:49:38,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:38,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:38,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:38,820 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:38,820 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:49:38,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,836 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2021-12-16 09:49:38,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-16 09:49:38,867 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:38,868 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:38,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:38,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,885 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2021-12-16 09:49:38,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-16 09:49:38,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:38,916 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:38,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:38,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:38,942 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2021-12-16 09:49:38,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-16 09:49:38,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:38,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:38,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:38,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:38,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:38,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:38,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,000 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2021-12-16 09:49:39,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-16 09:49:39,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:39,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:39,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-16 09:49:39,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,049 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2021-12-16 09:49:39,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-16 09:49:39,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:49:39,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:39,080 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:49:39,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-16 09:49:39,084 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:39,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:39,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:39,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:39,084 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:49:39,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:39,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:39,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2021-12-16 09:49:39,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:39,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:39,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:39,138 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:49:39,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,140 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2021-12-16 09:49:39,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-16 09:49:39,156 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 [2021-12-16 09:49:39,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:39,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,192 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2021-12-16 09:49:39,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-16 09:49:39,194 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 [2021-12-16 09:49:39,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:39,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-16 09:49:39,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,224 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2021-12-16 09:49:39,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-16 09:49:39,227 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 [2021-12-16 09:49:39,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:39,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,266 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2021-12-16 09:49:39,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-16 09:49:39,297 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 [2021-12-16 09:49:39,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:49:39,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:49:39,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:49:39,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,316 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2021-12-16 09:49:39,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-16 09:49:39,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:49:39,318 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:49:39,318 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:49:39,318 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2021-12-16 09:49:39,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,338 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:49:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:39,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:49:39,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:39,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:49:39,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:39,390 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 [2021-12-16 09:49:39,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:39,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 165 states and 172 transitions. Complement of second has 7 states. [2021-12-16 09:49:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:49:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2021-12-16 09:49:39,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2021-12-16 09:49:39,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:39,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 6 letters. [2021-12-16 09:49:39,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:39,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 12 letters. [2021-12-16 09:49:39,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:39,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 172 transitions. [2021-12-16 09:49:39,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-16 09:49:39,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 111 states and 115 transitions. [2021-12-16 09:49:39,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:49:39,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:49:39,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 115 transitions. [2021-12-16 09:49:39,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:49:39,414 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-12-16 09:49:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 115 transitions. [2021-12-16 09:49:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 60. [2021-12-16 09:49:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-12-16 09:49:39,417 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-12-16 09:49:39,417 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-12-16 09:49:39,417 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:49:39,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 62 transitions. [2021-12-16 09:49:39,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-16 09:49:39,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:49:39,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:49:39,418 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2021-12-16 09:49:39,418 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:49:39,418 INFO L791 eck$LassoCheckResult]: Stem: 1013#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(9, 2); 1014#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 1021#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1022#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1012#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1016#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1019#L18-5 assume { :end_inline___VERIFIER_assert } true; 1020#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1025#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1068#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1067#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1066#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1065#L18-5 assume { :end_inline___VERIFIER_assert } true; 1064#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1063#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1061#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1060#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1059#L18-5 assume { :end_inline___VERIFIER_assert } true; 1058#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1057#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1056#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1055#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1054#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1053#L18-5 assume { :end_inline___VERIFIER_assert } true; 1052#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1051#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1049#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1048#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1047#L18-5 assume { :end_inline___VERIFIER_assert } true; 1046#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1045#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1044#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1043#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1042#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1041#L18-5 assume { :end_inline___VERIFIER_assert } true; 1040#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1039#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1037#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1036#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1035#L18-5 assume { :end_inline___VERIFIER_assert } true; 1034#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1033#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1032#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1031#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1030#L18-5 assume { :end_inline___VERIFIER_assert } true; 1029#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1027#L28-3 assume !(main_~j~0#1 < 8); 1026#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1023#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1024#L28-3 [2021-12-16 09:49:39,418 INFO L793 eck$LassoCheckResult]: Loop: 1024#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1009#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1010#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1015#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1017#L18-5 assume { :end_inline___VERIFIER_assert } true; 1018#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1024#L28-3 [2021-12-16 09:49:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1852819737, now seen corresponding path program 2 times [2021-12-16 09:49:39,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:39,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671360514] [2021-12-16 09:49:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:39,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1426785425, now seen corresponding path program 2 times [2021-12-16 09:49:39,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:39,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590073775] [2021-12-16 09:49:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:39,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1846282505, now seen corresponding path program 3 times [2021-12-16 09:49:39,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:49:39,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148312013] [2021-12-16 09:49:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:49:39,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:49:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:49:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:49:39,518 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:49:39,568 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:39,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:39,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:39,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:39,569 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:49:39,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:39,569 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:39,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2021-12-16 09:49:39,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:39,570 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:39,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:39,606 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:49:39,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,607 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2021-12-16 09:49:39,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-16 09:49:39,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:39,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:39,629 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:49:39,630 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:49:39,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,646 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2021-12-16 09:49:39,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-16 09:49:39,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:49:39,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:39,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:39,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,672 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2021-12-16 09:49:39,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-16 09:49:39,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:49:39,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:49:39,700 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:49:39,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-16 09:49:39,703 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:49:39,703 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:49:39,703 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:49:39,703 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:49:39,703 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:49:39,703 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:49:39,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:49:39,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2021-12-16 09:49:39,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:49:39,704 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:49:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:49:39,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:49:39,745 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:49:39,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,746 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2021-12-16 09:49:39,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-16 09:49:39,748 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 [2021-12-16 09:49:39,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:49:39,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-16 09:49:39,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,775 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2021-12-16 09:49:39,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-16 09:49:39,776 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 [2021-12-16 09:49:39,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:49:39,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:49:39,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:49:39,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:49:39,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:49:39,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:49:39,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:49:39,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:49:39,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:49:39,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:49:39,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:49:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:49:39,787 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2021-12-16 09:49:39,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-16 09:49:39,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:49:39,788 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:49:39,788 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:49:39,788 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2021-12-16 09:49:39,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-16 09:49:39,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:49:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:39,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:49:39,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:39,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:49:39,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:39,977 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 [2021-12-16 09:49:39,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:39,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 158 transitions. Complement of second has 7 states. [2021-12-16 09:49:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:49:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2021-12-16 09:49:39,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 54 letters. Loop has 6 letters. [2021-12-16 09:49:39,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:39,998 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:49:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:40,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:49:40,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:49:40,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:40,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 09:49:40,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:40,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 158 transitions. Complement of second has 7 states. [2021-12-16 09:49:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:49:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2021-12-16 09:49:40,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 54 letters. Loop has 6 letters. [2021-12-16 09:49:40,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:40,142 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:49:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:49:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:40,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:49:40,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:49:40,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:49:40,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:49:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:49:40,269 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 09:49:40,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:40,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 108 states and 112 transitions. Complement of second has 6 states. [2021-12-16 09:49:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:49:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:49:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-16 09:49:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 54 letters. Loop has 6 letters. [2021-12-16 09:49:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 60 letters. Loop has 6 letters. [2021-12-16 09:49:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 54 letters. Loop has 12 letters. [2021-12-16 09:49:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:49:40,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 112 transitions. [2021-12-16 09:49:40,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 09:49:40,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. [2021-12-16 09:49:40,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 09:49:40,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 09:49:40,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 09:49:40,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:49:40,282 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:49:40,282 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:49:40,282 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 09:49:40,282 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:49:40,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-16 09:49:40,282 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 09:49:40,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-16 09:49:40,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 09:49:40 BoogieIcfgContainer [2021-12-16 09:49:40,286 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 09:49:40,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 09:49:40,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 09:49:40,287 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 09:49:40,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:49:36" (3/4) ... [2021-12-16 09:49:40,289 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 09:49:40,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 09:49:40,289 INFO L158 Benchmark]: Toolchain (without parser) took 4296.55ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 84.5MB in the beginning and 70.4MB in the end (delta: 14.1MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,290 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:49:40,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.25ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 88.3MB in the end (delta: -4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.88ms. Allocated memory is still 113.2MB. Free memory was 88.3MB in the beginning and 86.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,290 INFO L158 Benchmark]: Boogie Preprocessor took 21.34ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 86.0MB in the end (delta: 885.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:49:40,290 INFO L158 Benchmark]: RCFGBuilder took 181.21ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 77.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,291 INFO L158 Benchmark]: BuchiAutomizer took 3890.62ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 76.9MB in the beginning and 71.4MB in the end (delta: 5.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,291 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 169.9MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:49:40,292 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.15ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.25ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 88.3MB in the end (delta: -4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.88ms. Allocated memory is still 113.2MB. Free memory was 88.3MB in the beginning and 86.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.34ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 86.0MB in the end (delta: 885.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 181.21ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 77.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3890.62ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 76.9MB in the beginning and 71.4MB in the end (delta: 5.5MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 169.9MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function nlen + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 7 iterations. TraceHistogramMax:8. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 99 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 176/176 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 84 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq133 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-16 09:49:40,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:40,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-16 09:49:40,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 09:49:40,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE