./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/ldv-regression/test27-2.c -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 2292364e3df3925555991c57490c078c89b959e0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 15:16:12,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 15:16:12,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 15:16:12,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 15:16:12,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 15:16:12,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 15:16:12,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 15:16:12,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 15:16:12,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 15:16:12,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 15:16:12,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 15:16:12,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 15:16:12,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 15:16:12,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 15:16:12,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 15:16:12,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 15:16:12,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 15:16:12,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 15:16:12,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 15:16:12,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 15:16:12,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 15:16:12,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 15:16:12,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 15:16:12,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 15:16:12,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 15:16:12,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 15:16:12,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 15:16:12,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 15:16:12,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 15:16:12,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 15:16:12,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 15:16:12,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 15:16:12,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 15:16:12,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 15:16:12,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 15:16:12,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 15:16:12,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 15:16:12,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 15:16:12,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 15:16:12,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 15:16:12,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 15:16:12,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 15:16:12,533 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 15:16:12,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 15:16:12,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 15:16:12,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 15:16:12,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 15:16:12,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 15:16:12,537 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 15:16:12,537 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 15:16:12,537 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 15:16:12,538 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 15:16:12,538 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 15:16:12,539 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 15:16:12,539 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 15:16:12,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 15:16:12,539 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 15:16:12,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 15:16:12,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 15:16:12,541 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 15:16:12,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 15:16:12,542 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 15:16:12,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 15:16:12,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 15:16:12,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 15:16:12,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 15:16:12,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 15:16:12,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 15:16:12,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 15:16:12,544 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 15:16:12,545 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 -> 2292364e3df3925555991c57490c078c89b959e0 [2021-08-27 15:16:12,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 15:16:12,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 15:16:12,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 15:16:12,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 15:16:12,902 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 15:16:12,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2021-08-27 15:16:12,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b3600d4/0d198c400eff4f129be8f3d46c875ab9/FLAGa5e11b564 [2021-08-27 15:16:13,357 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 15:16:13,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2021-08-27 15:16:13,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b3600d4/0d198c400eff4f129be8f3d46c875ab9/FLAGa5e11b564 [2021-08-27 15:16:13,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b3600d4/0d198c400eff4f129be8f3d46c875ab9 [2021-08-27 15:16:13,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 15:16:13,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 15:16:13,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 15:16:13,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 15:16:13,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 15:16:13,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:16:13" (1/1) ... [2021-08-27 15:16:13,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@412ec7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:13, skipping insertion in model container [2021-08-27 15:16:13,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:16:13" (1/1) ... [2021-08-27 15:16:13,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 15:16:13,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 15:16:13,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2021-08-27 15:16:13,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:16:13,943 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 15:16:14,013 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2021-08-27 15:16:14,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:16:14,031 INFO L208 MainTranslator]: Completed translation [2021-08-27 15:16:14,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14 WrapperNode [2021-08-27 15:16:14,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 15:16:14,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 15:16:14,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 15:16:14,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 15:16:14,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 15:16:14,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 15:16:14,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 15:16:14,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 15:16:14,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 15:16:14,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 15:16:14,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 15:16:14,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 15:16:14,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (1/1) ... [2021-08-27 15:16:14,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:14,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:14,170 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-08-27 15:16:14,186 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-08-27 15:16:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 15:16:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 15:16:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 15:16:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 15:16:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 15:16:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 15:16:14,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 15:16:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 15:16:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 15:16:14,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 15:16:14,643 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 15:16:14,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:16:14 BoogieIcfgContainer [2021-08-27 15:16:14,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 15:16:14,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 15:16:14,645 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 15:16:14,649 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 15:16:14,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:16:14,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 03:16:13" (1/3) ... [2021-08-27 15:16:14,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6d5bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:16:14, skipping insertion in model container [2021-08-27 15:16:14,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:16:14,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:16:14" (2/3) ... [2021-08-27 15:16:14,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6d5bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:16:14, skipping insertion in model container [2021-08-27 15:16:14,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:16:14,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:16:14" (3/3) ... [2021-08-27 15:16:14,653 INFO L389 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2021-08-27 15:16:14,698 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 15:16:14,698 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 15:16:14,698 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 15:16:14,698 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 15:16:14,698 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 15:16:14,699 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 15:16:14,699 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 15:16:14,699 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 15:16:14,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:14,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 15:16:14,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:14,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:14,737 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:16:14,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:14,738 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 15:16:14,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:14,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 15:16:14,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:14,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:14,741 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:16:14,741 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:14,748 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 15#L29-3true [2021-08-27 15:16:14,748 INFO L793 eck$LassoCheckResult]: Loop: 15#L29-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 17#L29-2true main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 15#L29-3true [2021-08-27 15:16:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 15:16:14,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:14,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266479167] [2021-08-27 15:16:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:14,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:14,890 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:14,949 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 15:16:14,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:14,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220482706] [2021-08-27 15:16:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:14,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:14,984 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:15,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 15:16:15,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:15,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569296176] [2021-08-27 15:16:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:15,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:15,038 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:15,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:16,404 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:16:16,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:16:16,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:16:16,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:16:16,406 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:16:16,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:16,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:16:16,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:16:16,407 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2021-08-27 15:16:16,407 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:16:16,407 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:16:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:16,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:17,442 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:16:17,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:16:17,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:16:17,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 15:16:17,462 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-08-27 15:16:17,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 15:16:17,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:16:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 15:16:17,509 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-08-27 15:16:17,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:17,568 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,569 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-08-27 15:16:17,578 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-08-27 15:16:17,582 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-08-27 15:16:17,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:17,603 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,604 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-08-27 15:16:17,606 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-08-27 15:16:17,608 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-08-27 15:16:17,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,634 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-08-27 15:16:17,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,636 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-08-27 15:16:17,637 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-08-27 15:16:17,638 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-08-27 15:16:17,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,662 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-08-27 15:16:17,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,663 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-08-27 15:16:17,665 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-08-27 15:16:17,666 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-08-27 15:16:17,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,705 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-08-27 15:16:17,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,706 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-08-27 15:16:17,707 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-08-27 15:16:17,708 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-08-27 15:16:17,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,736 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-08-27 15:16:17,737 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,738 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-08-27 15:16:17,739 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-08-27 15:16:17,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:16:17,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,807 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-08-27 15:16:17,807 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,808 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-08-27 15:16:17,817 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-08-27 15:16:17,817 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-08-27 15:16:17,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-27 15:16:17,842 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,843 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-08-27 15:16:17,848 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-08-27 15:16:17,849 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-08-27 15:16:17,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,891 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-08-27 15:16:17,893 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,894 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-08-27 15:16:17,895 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-08-27 15:16:17,896 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-08-27 15:16:17,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:17,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:17,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:17,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,923 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-08-27 15:16:17,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,924 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-08-27 15:16:17,924 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-08-27 15:16:17,926 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-08-27 15:16:17,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:17,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 15:16:17,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:17,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:17,967 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-08-27 15:16:17,967 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-08-27 15:16:17,969 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-08-27 15:16:17,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:17,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:17,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:17,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:17,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:17,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:17,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,005 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-08-27 15:16:18,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,006 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-08-27 15:16:18,006 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-08-27 15:16:18,008 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-08-27 15:16:18,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,065 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-08-27 15:16:18,066 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-08-27 15:16:18,067 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-08-27 15:16:18,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,116 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-08-27 15:16:18,118 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-08-27 15:16:18,120 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-08-27 15:16:18,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,146 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-08-27 15:16:18,146 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,147 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-08-27 15:16:18,148 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-08-27 15:16:18,149 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-08-27 15:16:18,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,205 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,221 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-08-27 15:16:18,222 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-08-27 15:16:18,226 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-08-27 15:16:18,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,271 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-08-27 15:16:18,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,272 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-08-27 15:16:18,275 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-08-27 15:16:18,277 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-08-27 15:16:18,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,341 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-08-27 15:16:18,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,344 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-08-27 15:16:18,354 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-08-27 15:16:18,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:18,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:18,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:18,365 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-08-27 15:16:18,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,407 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-08-27 15:16:18,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,413 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-08-27 15:16:18,415 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-08-27 15:16:18,415 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-08-27 15:16:18,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,450 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-08-27 15:16:18,450 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,451 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-08-27 15:16:18,454 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-08-27 15:16:18,455 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-08-27 15:16:18,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:18,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:18,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:18,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,478 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-08-27 15:16:18,479 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,479 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-08-27 15:16:18,480 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-08-27 15:16:18,481 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-08-27 15:16:18,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,511 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-08-27 15:16:18,511 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-08-27 15:16:18,512 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-08-27 15:16:18,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:18,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:18,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:18,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,537 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-08-27 15:16:18,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,538 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-08-27 15:16:18,539 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-08-27 15:16:18,540 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-08-27 15:16:18,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,576 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-08-27 15:16:18,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,577 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-08-27 15:16:18,579 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-08-27 15:16:18,579 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-08-27 15:16:18,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:18,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:18,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:18,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-27 15:16:18,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,605 INFO L229 MonitoredProcess]: Starting monitored process 28 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-08-27 15:16:18,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 15:16:18,606 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-08-27 15:16:18,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-08-27 15:16:18,661 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,662 INFO L229 MonitoredProcess]: Starting monitored process 29 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-08-27 15:16:18,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 15:16:18,664 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-08-27 15:16:18,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-27 15:16:18,692 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,693 INFO L229 MonitoredProcess]: Starting monitored process 30 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-08-27 15:16:18,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 15:16:18,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:16:18,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,747 INFO L229 MonitoredProcess]: Starting monitored process 31 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-08-27 15:16:18,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 15:16:18,749 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-08-27 15:16:18,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:18,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:18,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:18,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,778 INFO L229 MonitoredProcess]: Starting monitored process 32 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-08-27 15:16:18,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 15:16:18,779 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-08-27 15:16:18,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:18,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:18,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,806 INFO L229 MonitoredProcess]: Starting monitored process 33 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-08-27 15:16:18,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 15:16:18,810 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-08-27 15:16:18,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:18,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:18,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:18,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:18,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:18,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:18,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:16:18,909 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-08-27 15:16:18,909 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-08-27 15:16:18,910 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:18,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:18,916 INFO L229 MonitoredProcess]: Starting monitored process 34 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-08-27 15:16:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 15:16:18,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:16:18,982 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:16:18,982 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:16:18,983 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~j~0 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2021-08-27 15:16:19,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:19,148 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2021-08-27 15:16:19,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:16:19,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:16:19,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:19,283 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-08-27 15:16:19,284 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:19,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 56 transitions. Complement of second has 8 states. [2021-08-27 15:16:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:16:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-08-27 15:16:19,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 15:16:19,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:19,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 15:16:19,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:19,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 15:16:19,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:19,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2021-08-27 15:16:19,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2021-08-27 15:16:19,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 15:16:19,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:19,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-08-27 15:16:19,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:19,386 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 15:16:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-08-27 15:16:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-27 15:16:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08-27 15:16:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2021-08-27 15:16:19,406 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 15:16:19,406 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 15:16:19,406 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 15:16:19,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2021-08-27 15:16:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:19,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:19,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 15:16:19,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:19,409 INFO L791 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 216#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 217#L29-3 assume !(main_~j~0 < 10); 218#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 221#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 222#L44-3 [2021-08-27 15:16:19,409 INFO L793 eck$LassoCheckResult]: Loop: 222#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 223#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 222#L44-3 [2021-08-27 15:16:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2021-08-27 15:16:19,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:19,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821664184] [2021-08-27 15:16:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:19,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:19,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821664184] [2021-08-27 15:16:19,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821664184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:16:19,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:16:19,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:16:19,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510343508] [2021-08-27 15:16:19,482 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2021-08-27 15:16:19,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:19,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262394849] [2021-08-27 15:16:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:19,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:19,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:19,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:16:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:16:19,542 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08-27 15:16:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:19,556 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-08-27 15:16:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:16:19,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-08-27 15:16:19,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 15:16:19,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:19,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:19,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-08-27 15:16:19,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:19,560 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 15:16:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-08-27 15:16:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-08-27 15:16:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-08-27 15:16:19,563 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 15:16:19,563 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 15:16:19,563 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 15:16:19,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-08-27 15:16:19,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:19,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:19,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:19,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:19,564 INFO L791 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 241#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 242#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 243#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 244#L29-3 assume !(main_~j~0 < 10); 245#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 246#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 247#L44-3 [2021-08-27 15:16:19,565 INFO L793 eck$LassoCheckResult]: Loop: 247#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 248#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 247#L44-3 [2021-08-27 15:16:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2021-08-27 15:16:19,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:19,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250945676] [2021-08-27 15:16:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:19,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:19,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250945676] [2021-08-27 15:16:19,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250945676] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:19,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933291178] [2021-08-27 15:16:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:19,639 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:19,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-27 15:16:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 15:16:19,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:19,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933291178] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:19,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:19,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 15:16:19,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891498224] [2021-08-27 15:16:19,749 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2021-08-27 15:16:19,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:19,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065669630] [2021-08-27 15:16:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:19,754 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:19,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:19,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:16:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:16:19,792 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:19,808 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-08-27 15:16:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:16:19,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-08-27 15:16:19,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2021-08-27 15:16:19,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:19,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:19,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-08-27 15:16:19,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:19,810 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-27 15:16:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-08-27 15:16:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-08-27 15:16:19,811 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-08-27 15:16:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 15:16:19,811 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 15:16:19,811 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 15:16:19,811 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 15:16:19,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-08-27 15:16:19,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:19,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:19,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:19,812 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-08-27 15:16:19,813 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:19,813 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 288#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 289#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 290#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 291#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 292#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 297#L29-3 assume !(main_~j~0 < 10); 293#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 294#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 295#L44-3 [2021-08-27 15:16:19,813 INFO L793 eck$LassoCheckResult]: Loop: 295#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 296#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 295#L44-3 [2021-08-27 15:16:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2021-08-27 15:16:19,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:19,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702987416] [2021-08-27 15:16:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:19,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:19,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:19,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702987416] [2021-08-27 15:16:19,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702987416] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:19,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613776375] [2021-08-27 15:16:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:16:19,859 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:19,860 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-27 15:16:19,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:16:19,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:19,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:16:19,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:20,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613776375] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:20,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:20,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 15:16:20,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25110453] [2021-08-27 15:16:20,007 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2021-08-27 15:16:20,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:20,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112020785] [2021-08-27 15:16:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:20,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:20,016 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:20,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:20,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 15:16:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:16:20,058 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-08-27 15:16:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:20,097 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-08-27 15:16:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:16:20,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-08-27 15:16:20,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:20,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2021-08-27 15:16:20,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:20,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:20,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-08-27 15:16:20,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:20,102 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-27 15:16:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-08-27 15:16:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-08-27 15:16:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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-08-27 15:16:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 15:16:20,104 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 15:16:20,104 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 15:16:20,104 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 15:16:20,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2021-08-27 15:16:20,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:20,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:20,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:20,105 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2021-08-27 15:16:20,105 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:20,105 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 346#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 347#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 348#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 355#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 357#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 349#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 350#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 356#L29-3 assume !(main_~j~0 < 10); 351#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 352#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 353#L44-3 [2021-08-27 15:16:20,106 INFO L793 eck$LassoCheckResult]: Loop: 353#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 354#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 353#L44-3 [2021-08-27 15:16:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2021-08-27 15:16:20,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:20,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794912696] [2021-08-27 15:16:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:20,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:20,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:20,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794912696] [2021-08-27 15:16:20,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794912696] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:20,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967436274] [2021-08-27 15:16:20,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:16:20,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:20,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:20,181 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:20,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-27 15:16:20,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:16:20,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:20,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 15:16:20,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:20,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967436274] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:20,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:20,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 15:16:20,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000656510] [2021-08-27 15:16:20,482 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2021-08-27 15:16:20,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:20,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660972270] [2021-08-27 15:16:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:20,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:20,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:20,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:20,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 15:16:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 15:16:20,522 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-08-27 15:16:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:20,550 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2021-08-27 15:16:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 15:16:20,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2021-08-27 15:16:20,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:20,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2021-08-27 15:16:20,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:20,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:20,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2021-08-27 15:16:20,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:20,554 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-27 15:16:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2021-08-27 15:16:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-08-27 15:16:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 15:16:20,557 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 15:16:20,557 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 15:16:20,557 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 15:16:20,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-08-27 15:16:20,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:20,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:20,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:20,560 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-08-27 15:16:20,560 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:20,560 INFO L791 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 415#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 416#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 417#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 418#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 419#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 424#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 428#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 427#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 426#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 425#L29-3 assume !(main_~j~0 < 10); 420#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 421#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 422#L44-3 [2021-08-27 15:16:20,560 INFO L793 eck$LassoCheckResult]: Loop: 422#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 423#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 422#L44-3 [2021-08-27 15:16:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2021-08-27 15:16:20,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:20,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468958074] [2021-08-27 15:16:20,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:20,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:20,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:20,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468958074] [2021-08-27 15:16:20,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468958074] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:20,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221985815] [2021-08-27 15:16:20,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:16:20,640 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:20,641 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:20,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-27 15:16:20,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:16:20,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:20,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:16:20,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:21,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221985815] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:21,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:21,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 15:16:21,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753639563] [2021-08-27 15:16:21,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2021-08-27 15:16:21,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:21,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175643482] [2021-08-27 15:16:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:21,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:21,022 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:21,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:21,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 15:16:21,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 15:16:21,068 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:21,098 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-08-27 15:16:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:16:21,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2021-08-27 15:16:21,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:21,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2021-08-27 15:16:21,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:21,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:21,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2021-08-27 15:16:21,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:21,105 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-08-27 15:16:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2021-08-27 15:16:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 15:16:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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-08-27 15:16:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 15:16:21,107 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 15:16:21,108 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 15:16:21,108 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 15:16:21,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-08-27 15:16:21,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:21,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:21,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:21,109 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2021-08-27 15:16:21,109 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:21,109 INFO L791 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 499#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 494#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 495#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 496#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 497#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 504#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 510#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 509#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 508#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 507#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 506#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 505#L29-3 assume !(main_~j~0 < 10); 500#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 501#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 502#L44-3 [2021-08-27 15:16:21,109 INFO L793 eck$LassoCheckResult]: Loop: 502#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 503#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 502#L44-3 [2021-08-27 15:16:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2021-08-27 15:16:21,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:21,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820632135] [2021-08-27 15:16:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:21,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:21,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:21,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820632135] [2021-08-27 15:16:21,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820632135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:21,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416530963] [2021-08-27 15:16:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 15:16:21,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:21,184 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:21,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-27 15:16:21,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 15:16:21,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:21,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 15:16:21,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:21,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416530963] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:21,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:21,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 15:16:21,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637192379] [2021-08-27 15:16:21,475 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2021-08-27 15:16:21,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:21,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85220622] [2021-08-27 15:16:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:21,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:21,481 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:21,496 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:21,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 15:16:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 15:16:21,529 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-08-27 15:16:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:21,557 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-08-27 15:16:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 15:16:21,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-08-27 15:16:21,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:21,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-08-27 15:16:21,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:21,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:21,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-08-27 15:16:21,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:21,560 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-08-27 15:16:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-08-27 15:16:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 15:16:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 15:16:21,561 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 15:16:21,561 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 15:16:21,561 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 15:16:21,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-08-27 15:16:21,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:21,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:21,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:21,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2021-08-27 15:16:21,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:21,562 INFO L791 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 590#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 585#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 586#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 587#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 588#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 595#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 603#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 602#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 601#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 600#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 599#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 598#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 597#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 596#L29-3 assume !(main_~j~0 < 10); 591#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 592#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 593#L44-3 [2021-08-27 15:16:21,563 INFO L793 eck$LassoCheckResult]: Loop: 593#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 594#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 593#L44-3 [2021-08-27 15:16:21,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:21,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2021-08-27 15:16:21,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:21,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512223985] [2021-08-27 15:16:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:21,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:21,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:21,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512223985] [2021-08-27 15:16:21,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512223985] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:21,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429823280] [2021-08-27 15:16:21,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 15:16:21,637 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:21,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:21,638 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:21,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-27 15:16:22,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 15:16:22,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:22,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 15:16:22,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:22,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429823280] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:22,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:22,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 15:16:22,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028901824] [2021-08-27 15:16:22,324 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2021-08-27 15:16:22,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:22,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125793731] [2021-08-27 15:16:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:22,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:22,328 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:22,330 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:22,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 15:16:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 15:16:22,365 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:22,393 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-08-27 15:16:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 15:16:22,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2021-08-27 15:16:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:22,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2021-08-27 15:16:22,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:22,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:22,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2021-08-27 15:16:22,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:22,395 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 15:16:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2021-08-27 15:16:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-27 15:16:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-08-27 15:16:22,397 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 15:16:22,397 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 15:16:22,397 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 15:16:22,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2021-08-27 15:16:22,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:22,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:22,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:22,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2021-08-27 15:16:22,398 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:22,399 INFO L791 eck$LassoCheckResult]: Stem: 691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 692#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 687#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 688#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 689#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 690#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 697#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 707#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 706#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 705#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 704#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 703#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 702#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 701#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 700#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 699#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 698#L29-3 assume !(main_~j~0 < 10); 693#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 694#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 695#L44-3 [2021-08-27 15:16:22,399 INFO L793 eck$LassoCheckResult]: Loop: 695#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 696#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 695#L44-3 [2021-08-27 15:16:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2021-08-27 15:16:22,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:22,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369107770] [2021-08-27 15:16:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:22,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:22,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:22,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369107770] [2021-08-27 15:16:22,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369107770] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:22,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500097320] [2021-08-27 15:16:22,506 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 15:16:22,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:22,549 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:22,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-27 15:16:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:22,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 15:16:22,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:22,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500097320] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:22,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:22,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 15:16:22,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992195096] [2021-08-27 15:16:22,771 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2021-08-27 15:16:22,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:22,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003119688] [2021-08-27 15:16:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:22,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:22,775 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:22,778 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:22,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:22,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 15:16:22,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 15:16:22,814 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:22,858 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-08-27 15:16:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 15:16:22,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2021-08-27 15:16:22,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:22,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2021-08-27 15:16:22,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:22,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:22,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2021-08-27 15:16:22,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:22,861 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-08-27 15:16:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2021-08-27 15:16:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-08-27 15:16:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 15:16:22,863 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 15:16:22,863 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 15:16:22,863 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 15:16:22,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2021-08-27 15:16:22,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:22,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:22,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:22,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2021-08-27 15:16:22,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:22,865 INFO L791 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 801#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 802#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 803#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 804#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 805#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 810#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 822#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 821#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 820#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 819#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 818#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 817#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 816#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 815#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 814#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 813#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 812#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 811#L29-3 assume !(main_~j~0 < 10); 806#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 807#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 808#L44-3 [2021-08-27 15:16:22,865 INFO L793 eck$LassoCheckResult]: Loop: 808#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 809#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 808#L44-3 [2021-08-27 15:16:22,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2021-08-27 15:16:22,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:22,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046630014] [2021-08-27 15:16:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:22,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:22,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:22,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046630014] [2021-08-27 15:16:22,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046630014] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:22,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576972943] [2021-08-27 15:16:22,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:16:22,965 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:22,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:22,973 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:22,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-27 15:16:23,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:16:23,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:23,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 15:16:23,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:23,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576972943] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:23,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:23,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 15:16:23,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949740748] [2021-08-27 15:16:23,194 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2021-08-27 15:16:23,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:23,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362096054] [2021-08-27 15:16:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:23,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:23,210 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:23,213 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:23,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:23,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 15:16:23,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 15:16:23,245 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:23,291 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-08-27 15:16:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 15:16:23,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2021-08-27 15:16:23,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:23,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2021-08-27 15:16:23,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:23,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:23,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2021-08-27 15:16:23,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:23,294 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-08-27 15:16:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2021-08-27 15:16:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 15:16:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 15:16:23,297 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 15:16:23,297 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 15:16:23,297 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 15:16:23,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-27 15:16:23,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:23,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:23,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:23,300 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2021-08-27 15:16:23,301 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:23,302 INFO L791 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 925#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 926#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 927#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 928#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 929#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 934#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 948#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 947#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 946#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 945#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 944#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 943#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 942#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 941#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 940#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 939#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 938#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 937#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 936#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 935#L29-3 assume !(main_~j~0 < 10); 930#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 931#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 932#L44-3 [2021-08-27 15:16:23,302 INFO L793 eck$LassoCheckResult]: Loop: 932#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 933#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 932#L44-3 [2021-08-27 15:16:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2021-08-27 15:16:23,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:23,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298927520] [2021-08-27 15:16:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:23,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:23,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:23,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298927520] [2021-08-27 15:16:23,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298927520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:23,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903195803] [2021-08-27 15:16:23,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:16:23,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:23,433 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:23,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-27 15:16:30,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 15:16:30,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:16:30,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 15:16:30,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:30,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903195803] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:30,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:30,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 15:16:30,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599748479] [2021-08-27 15:16:30,748 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2021-08-27 15:16:30,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:30,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372510194] [2021-08-27 15:16:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:30,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:30,754 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:30,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:30,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 15:16:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 15:16:30,790 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:30,844 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-08-27 15:16:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 15:16:30,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2021-08-27 15:16:30,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:30,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2021-08-27 15:16:30,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 15:16:30,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 15:16:30,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-08-27 15:16:30,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:30,846 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-27 15:16:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-08-27 15:16:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-27 15:16:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-08-27 15:16:30,853 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-27 15:16:30,853 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-27 15:16:30,853 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 15:16:30,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-08-27 15:16:30,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 15:16:30,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:30,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:30,856 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2021-08-27 15:16:30,856 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:16:30,856 INFO L791 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1059#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 1060#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1061#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1062#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1063#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1068#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1084#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1083#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1082#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1081#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1080#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1079#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1078#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1077#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1076#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1075#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1074#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1073#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1072#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1071#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1070#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1069#L29-3 assume !(main_~j~0 < 10); 1064#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1065#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 1066#L44-3 [2021-08-27 15:16:30,856 INFO L793 eck$LassoCheckResult]: Loop: 1066#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1067#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 1066#L44-3 [2021-08-27 15:16:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2021-08-27 15:16:30,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:30,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295688439] [2021-08-27 15:16:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:30,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:37,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:37,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295688439] [2021-08-27 15:16:37,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295688439] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:37,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452720724] [2021-08-27 15:16:37,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:16:37,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:37,286 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:37,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-08-27 15:19:45,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:19:45,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:19:45,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 72 conjunts are in the unsatisfiable core [2021-08-27 15:19:45,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:19:45,594 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-08-27 15:19:45,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 33 [2021-08-27 15:19:45,802 INFO L354 Elim1Store]: treesize reduction 208, result has 13.7 percent of original size [2021-08-27 15:19:45,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 82 [2021-08-27 15:19:45,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2021-08-27 15:19:46,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-08-27 15:19:46,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2021-08-27 15:19:46,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2021-08-27 15:19:46,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:46,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2021-08-27 15:19:47,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2021-08-27 15:19:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:47,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 81 [2021-08-27 15:19:48,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 93 [2021-08-27 15:19:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2021-08-27 15:19:48,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:48,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 117 [2021-08-27 15:19:49,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:49,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 132 [2021-08-27 15:19:50,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 15:19:50,317 INFO L354 Elim1Store]: treesize reduction 1932, result has 0.1 percent of original size [2021-08-27 15:19:50,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 48 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 390 treesize of output 1 [2021-08-27 15:19:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:19:50,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452720724] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:19:50,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:19:50,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 41 [2021-08-27 15:19:50,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044651491] [2021-08-27 15:19:50,322 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:19:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:19:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2021-08-27 15:19:50,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:19:50,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174587681] [2021-08-27 15:19:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:19:50,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:19:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:19:50,328 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:19:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:19:50,330 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:19:50,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:19:50,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-08-27 15:19:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2021-08-27 15:19:50,368 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:19:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:19:51,742 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2021-08-27 15:19:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 15:19:51,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 27 transitions. [2021-08-27 15:19:51,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:19:51,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2021-08-27 15:19:51,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 15:19:51,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 15:19:51,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 15:19:51,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:19:51,743 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:19:51,743 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:19:51,744 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:19:51,744 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 15:19:51,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 15:19:51,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:19:51,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 15:19:51,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 03:19:51 BoogieIcfgContainer [2021-08-27 15:19:51,749 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 15:19:51,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 15:19:51,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 15:19:51,750 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 15:19:51,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:16:14" (3/4) ... [2021-08-27 15:19:51,753 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 15:19:51,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 15:19:51,754 INFO L168 Benchmark]: Toolchain (without parser) took 217977.86 ms. Allocated memory was 48.2 MB in the beginning and 287.3 MB in the end (delta: 239.1 MB). Free memory was 24.9 MB in the beginning and 86.2 MB in the end (delta: -61.3 MB). Peak memory consumption was 178.8 MB. Max. memory is 16.1 GB. [2021-08-27 15:19:51,754 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory is still 31.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:19:51,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.15 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 24.7 MB in the beginning and 46.5 MB in the end (delta: -21.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-08-27 15:19:51,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 62.9 MB. Free memory was 46.5 MB in the beginning and 44.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:19:51,755 INFO L168 Benchmark]: Boogie Preprocessor took 51.13 ms. Allocated memory is still 62.9 MB. Free memory was 44.8 MB in the beginning and 43.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 15:19:51,755 INFO L168 Benchmark]: RCFGBuilder took 499.66 ms. Allocated memory is still 62.9 MB. Free memory was 43.2 MB in the beginning and 34.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2021-08-27 15:19:51,755 INFO L168 Benchmark]: BuchiAutomizer took 217104.04 ms. Allocated memory was 62.9 MB in the beginning and 287.3 MB in the end (delta: 224.4 MB). Free memory was 34.6 MB in the beginning and 86.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 173.2 MB. Max. memory is 16.1 GB. [2021-08-27 15:19:51,756 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 287.3 MB. Free memory is still 86.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:19:51,757 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.20 ms. Allocated memory is still 48.2 MB. Free memory is still 31.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 256.15 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 24.7 MB in the beginning and 46.5 MB in the end (delta: -21.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 62.9 MB. Free memory was 46.5 MB in the beginning and 44.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.13 ms. Allocated memory is still 62.9 MB. Free memory was 44.8 MB in the beginning and 43.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 499.66 ms. Allocated memory is still 62.9 MB. Free memory was 43.2 MB in the beginning and 34.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 217104.04 ms. Allocated memory was 62.9 MB in the beginning and 287.3 MB in the end (delta: 224.4 MB). Free memory was 34.6 MB in the beginning and 86.2 MB in the end (delta: -51.6 MB). Peak memory consumption was 173.2 MB. Max. memory is 16.1 GB. * Witness Printer took 3.36 ms. Allocated memory is still 287.3 MB. Free memory is still 86.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[a] + -8 * j and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 42 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 217.0s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 214.9s. Construction of modules took 0.9s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 34.5ms AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 80 SDslu, 144 SDs, 0 SdLazy, 622 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 945.6ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital419 mio100 ax100 hnf100 lsp95 ukn34 mio100 lsp41 div100 bol100 ite100 ukn100 eq165 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 15:19:51,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-08-27 15:19:51,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2021-08-27 15:19:52,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-08-27 15:19:52,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-08-27 15:19:52,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-08-27 15:19:52,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-08-27 15:19:52,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-27 15:19:53,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-27 15:19:53,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-27 15:19:53,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-08-27 15:19:53,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...