./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcspn.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eaca3e09b762fe94634aa0b3e6a04213782212a5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:07,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:07,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:07,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:07,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:07,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:07,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:07,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:07,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:07,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:07,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:07,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:07,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:07,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:07,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:07,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:07,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:07,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:07,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:07,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:07,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:07,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:07,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:07,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:07,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:07,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:07,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:07,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:07,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:07,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:07,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:07,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:07,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:07,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:07,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:07,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:07,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:07,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:07,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:07,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:07,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:07,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:07,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:07,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:07,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:07,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:07,112 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:07,112 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:07,112 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:07,112 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:07,112 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:07,113 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:07,113 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:07,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:07,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:07,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:07,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:07,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:07,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:07,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:07,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:07,115 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:07,115 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:07,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:07,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:07,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:07,116 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:07,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:07,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:07,117 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:07,119 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:07,120 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaca3e09b762fe94634aa0b3e6a04213782212a5 [2019-10-22 09:01:07,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:07,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:07,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:07,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:07,179 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:07,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn.i [2019-10-22 09:01:07,233 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/data/95d235dfa/3f3f295b7f66475a91e8db62c82ef25d/FLAG24333b556 [2019-10-22 09:01:07,656 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:07,657 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/sv-benchmarks/c/termination-libowfat/strcspn.i [2019-10-22 09:01:07,671 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/data/95d235dfa/3f3f295b7f66475a91e8db62c82ef25d/FLAG24333b556 [2019-10-22 09:01:07,999 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/data/95d235dfa/3f3f295b7f66475a91e8db62c82ef25d [2019-10-22 09:01:08,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:08,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:08,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:08,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:08,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:08,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24020f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08, skipping insertion in model container [2019-10-22 09:01:08,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,019 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:08,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:08,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:08,517 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:08,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:08,624 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:08,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08 WrapperNode [2019-10-22 09:01:08,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:08,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:08,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:08,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:08,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:08,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:08,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:08,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:08,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... [2019-10-22 09:01:08,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:08,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:08,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:08,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:08,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:08,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:08,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:08,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:08,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:09,046 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:09,046 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:09,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:09 BoogieIcfgContainer [2019-10-22 09:01:09,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:09,048 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:09,049 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:09,055 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:09,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:09,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:08" (1/3) ... [2019-10-22 09:01:09,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55754e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:09, skipping insertion in model container [2019-10-22 09:01:09,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:09,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:08" (2/3) ... [2019-10-22 09:01:09,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55754e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:09, skipping insertion in model container [2019-10-22 09:01:09,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:09,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:09" (3/3) ... [2019-10-22 09:01:09,066 INFO L371 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2019-10-22 09:01:09,139 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:09,140 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:09,141 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:09,141 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:09,141 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:09,141 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:09,141 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:09,142 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:09,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:01:09,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:01:09,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:09,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:09,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:09,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:09,199 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:09,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:01:09,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:01:09,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:09,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:09,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:09,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:09,213 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2019-10-22 09:01:09,213 INFO L793 eck$LassoCheckResult]: Loop: 18#L510-4true call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2019-10-22 09:01:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-10-22 09:01:09,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874538170] [2019-10-22 09:01:09,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,439 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2019-10-22 09:01:09,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301104436] [2019-10-22 09:01:09,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:09,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301104436] [2019-10-22 09:01:09,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:09,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:09,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024265132] [2019-10-22 09:01:09,482 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:09,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:09,503 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-10-22 09:01:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:09,511 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-10-22 09:01:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:09,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-10-22 09:01:09,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:01:09,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2019-10-22 09:01:09,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:09,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:09,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-10-22 09:01:09,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:09,522 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:01:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-10-22 09:01:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:01:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:01:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-10-22 09:01:09,551 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:01:09,551 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:01:09,552 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:09,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-10-22 09:01:09,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:01:09,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:09,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:09,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:09,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:09,554 INFO L791 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2019-10-22 09:01:09,554 INFO L793 eck$LassoCheckResult]: Loop: 53#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2019-10-22 09:01:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-10-22 09:01:09,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253276569] [2019-10-22 09:01:09,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2019-10-22 09:01:09,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055169459] [2019-10-22 09:01:09,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2019-10-22 09:01:09,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242228396] [2019-10-22 09:01:09,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:09,751 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:10,208 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-22 09:01:10,337 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 09:01:10,350 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:10,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:10,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:10,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:10,351 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:10,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:10,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:10,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:10,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2019-10-22 09:01:10,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:10,352 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:10,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,785 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-22 09:01:10,928 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-22 09:01:10,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:10,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:11,690 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:11,823 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:11,829 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:11,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,832 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:11,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:11,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:11,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:11,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:11,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,852 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:11,852 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:11,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,863 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:11,863 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:11,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:11,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:11,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:11,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:11,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:11,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:11,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:11,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:11,968 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:12,030 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:12,035 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:12,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:12,039 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:12,043 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:12,044 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2019-10-22 09:01:12,098 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 09:01:12,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:12,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:12,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:12,196 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 [2019-10-22 09:01:12,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-10-22 09:01:12,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2019-10-22 09:01:12,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-10-22 09:01:12,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2019-10-22 09:01:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 09:01:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2019-10-22 09:01:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:12,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-10-22 09:01:12,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:12,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2019-10-22 09:01:12,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:01:12,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:12,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 09:01:12,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:12,263 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 09:01:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 09:01:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 09:01:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:01:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 09:01:12,265 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 09:01:12,265 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 09:01:12,265 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:12,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 09:01:12,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:12,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:12,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:12,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:12,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:12,267 INFO L791 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 184#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 185#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 196#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 199#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 192#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 193#L511-4 [2019-10-22 09:01:12,267 INFO L793 eck$LassoCheckResult]: Loop: 193#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 186#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 187#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 197#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 193#L511-4 [2019-10-22 09:01:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,268 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2019-10-22 09:01:12,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:12,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790796362] [2019-10-22 09:01:12,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2019-10-22 09:01:12,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:12,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092393404] [2019-10-22 09:01:12,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2019-10-22 09:01:12,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:12,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360609867] [2019-10-22 09:01:12,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:12,385 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:12,796 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-10-22 09:01:12,919 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 09:01:12,920 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:12,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:12,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:12,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:12,921 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:12,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:12,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:12,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:12,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2019-10-22 09:01:12,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:12,921 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:12,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:12,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,264 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-22 09:01:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:13,773 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:13,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:13,891 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:13,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:13,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:13,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:13,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:13,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:13,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:13,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:13,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:13,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:13,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:13,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:13,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,908 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:13,909 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:13,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,912 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:01:13,913 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-10-22 09:01:13,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,926 INFO L400 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2019-10-22 09:01:13,926 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-10-22 09:01:13,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:13,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:13,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:13,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:13,991 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:13,992 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:13,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:13,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:13,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:14,000 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:01:14,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:14,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:14,005 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:14,005 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:14,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:14,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:14,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:14,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:14,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:14,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:14,057 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:14,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:14,084 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:14,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:14,110 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:14,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:14,113 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:14,113 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:14,114 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~reject.offset, ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2) = -1*ULTIMATE.start_strcspn_~reject.offset - 1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2 Supporting invariants [] [2019-10-22 09:01:14,169 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 09:01:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:14,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:14,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,278 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 09:01:14,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 09:01:14,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 45 states and 51 transitions. Complement of second has 6 states. [2019-10-22 09:01:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:01:14,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 09:01:14,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:14,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 09:01:14,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:14,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 09:01:14,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:14,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2019-10-22 09:01:14,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:14,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2019-10-22 09:01:14,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:01:14,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:01:14,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2019-10-22 09:01:14,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:14,340 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 09:01:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2019-10-22 09:01:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-22 09:01:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:01:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-22 09:01:14,342 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 09:01:14,342 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 09:01:14,342 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:14,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-10-22 09:01:14,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:14,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:14,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:14,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:14,344 INFO L791 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 370#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 380#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 386#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 389#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 391#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 390#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 388#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 384#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 385#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 376#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 377#L511-4 [2019-10-22 09:01:14,345 INFO L793 eck$LassoCheckResult]: Loop: 377#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 371#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 372#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 381#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 377#L511-4 [2019-10-22 09:01:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2019-10-22 09:01:14,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947346065] [2019-10-22 09:01:14,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,394 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2019-10-22 09:01:14,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151358046] [2019-10-22 09:01:14,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,411 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2019-10-22 09:01:14,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276131410] [2019-10-22 09:01:14,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276131410] [2019-10-22 09:01:14,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028285339] [2019-10-22 09:01:14,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5db49047-b182-43a3-80fb-f85fbca88a8a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:01:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:14,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 09:01:14,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:14,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:14,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:14,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 09:01:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:14,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-22 09:01:14,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034654044] [2019-10-22 09:01:14,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:01:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:01:14,797 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2019-10-22 09:01:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:14,946 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-10-22 09:01:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:14,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2019-10-22 09:01:14,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:14,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2019-10-22 09:01:14,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:01:14,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:01:14,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-10-22 09:01:14,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:14,949 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-22 09:01:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-10-22 09:01:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-10-22 09:01:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 09:01:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-22 09:01:14,952 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-22 09:01:14,952 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-22 09:01:14,953 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:14,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2019-10-22 09:01:14,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:14,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:14,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:14,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:14,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:14,955 INFO L791 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 510#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 520#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 524#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 528#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 525#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 513#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 514#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 522#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 523#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 530#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 529#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 526#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 527#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 516#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 517#L511-4 [2019-10-22 09:01:14,955 INFO L793 eck$LassoCheckResult]: Loop: 517#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 511#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 512#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 521#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 517#L511-4 [2019-10-22 09:01:14,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2019-10-22 09:01:14,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106793158] [2019-10-22 09:01:14,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,990 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2019-10-22 09:01:14,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612981483] [2019-10-22 09:01:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:14,998 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2019-10-22 09:01:14,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548816590] [2019-10-22 09:01:14,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:15,023 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:15,618 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 141 [2019-10-22 09:01:15,762 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-10-22 09:01:15,764 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:15,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:15,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:15,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:15,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:15,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:15,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:15,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:15,764 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2019-10-22 09:01:15,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:15,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:15,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:15,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,270 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-10-22 09:01:16,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:16,905 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:17,167 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-22 09:01:17,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:17,191 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:17,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,193 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:17,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:17,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:17,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:17,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:17,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:17,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:17,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:17,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:17,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:17,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:17,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:17,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:17,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:17,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:17,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,213 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,213 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,219 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,219 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,224 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:01:17,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,226 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:17,227 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,243 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,243 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:17,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:17,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:17,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:17,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:17,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:17,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:17,253 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:17,304 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:17,387 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:17,387 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:17,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:17,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:17,390 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:17,390 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2019-10-22 09:01:17,513 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2019-10-22 09:01:17,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:17,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-10-22 09:01:17,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-10-22 09:01:17,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-10-22 09:01:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:01:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 09:01:17,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 09:01:17,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:17,700 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:17,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2019-10-22 09:01:17,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-10-22 09:01:17,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-10-22 09:01:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:01:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 09:01:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 09:01:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:17,897 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:17,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:18,031 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-10-22 09:01:18,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-10-22 09:01:18,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2019-10-22 09:01:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2019-10-22 09:01:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:01:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2019-10-22 09:01:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 09:01:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2019-10-22 09:01:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2019-10-22 09:01:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:18,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2019-10-22 09:01:18,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:18,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2019-10-22 09:01:18,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:01:18,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:18,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-10-22 09:01:18,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:18,149 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-22 09:01:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-10-22 09:01:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-10-22 09:01:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 09:01:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 09:01:18,152 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 09:01:18,152 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 09:01:18,152 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:18,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-10-22 09:01:18,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:18,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:18,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:18,154 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-10-22 09:01:18,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:18,155 INFO L791 eck$LassoCheckResult]: Stem: 1046#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1040#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1041#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1051#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1055#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1060#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1071#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1068#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1070#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1069#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1067#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1066#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1065#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1056#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1057#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1049#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1050#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1044#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1045#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1053#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1054#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1072#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1061#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1062#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1063#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1047#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1048#L511-4 [2019-10-22 09:01:18,155 INFO L793 eck$LassoCheckResult]: Loop: 1048#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1042#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1043#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1052#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1048#L511-4 [2019-10-22 09:01:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2019-10-22 09:01:18,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:18,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248362190] [2019-10-22 09:01:18,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2019-10-22 09:01:18,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:18,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527126326] [2019-10-22 09:01:18,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,191 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2019-10-22 09:01:18,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:18,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794130378] [2019-10-22 09:01:18,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:18,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:18,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:18,980 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 174 [2019-10-22 09:01:19,157 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-10-22 09:01:19,160 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:19,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:19,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:19,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:19,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:19,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:19,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:19,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:19,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration6_Lasso [2019-10-22 09:01:19,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:19,161 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:19,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:19,647 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-10-22 09:01:19,999 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 09:01:21,039 WARN L191 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-10-22 09:01:21,305 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:21,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:21,328 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:21,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,336 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,339 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,345 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,358 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,360 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,360 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,364 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,364 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,376 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,376 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:21,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,378 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:21,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:21,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,381 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,381 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,385 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,385 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,391 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,391 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:21,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:21,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:21,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:21,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:21,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:21,397 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:21,397 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:21,436 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:21,481 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:21,481 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:01:21,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:21,482 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:21,483 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:21,483 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -2*ULTIMATE.start_strcspn_~i~0 + 5*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2019-10-22 09:01:21,635 INFO L297 tatePredicateManager]: 35 out of 36 supporting invariants were superfluous and have been removed [2019-10-22 09:01:21,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 09:01:21,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:21,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:21,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2019-10-22 09:01:21,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-10-22 09:01:21,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 37 states and 41 transitions. Complement of second has 5 states. [2019-10-22 09:01:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 09:01:21,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2019-10-22 09:01:21,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:21,859 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 09:01:21,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:21,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,021 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2019-10-22 09:01:22,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-10-22 09:01:22,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 37 states and 41 transitions. Complement of second has 5 states. [2019-10-22 09:01:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-10-22 09:01:22,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2019-10-22 09:01:22,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:22,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 09:01:22,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:22,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,242 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2019-10-22 09:01:22,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-10-22 09:01:22,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 66 states and 74 transitions. Complement of second has 13 states. [2019-10-22 09:01:22,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2019-10-22 09:01:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2019-10-22 09:01:22,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 4 letters. [2019-10-22 09:01:22,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:22,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 30 letters. Loop has 4 letters. [2019-10-22 09:01:22,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:22,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 8 letters. [2019-10-22 09:01:22,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:22,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2019-10-22 09:01:22,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:22,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 52 states and 57 transitions. [2019-10-22 09:01:22,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:01:22,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:22,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2019-10-22 09:01:22,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:22,425 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-10-22 09:01:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2019-10-22 09:01:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-10-22 09:01:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 09:01:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-10-22 09:01:22,434 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-10-22 09:01:22,434 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-10-22 09:01:22,434 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:22,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2019-10-22 09:01:22,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:22,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:22,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:22,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-10-22 09:01:22,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:22,436 INFO L791 eck$LassoCheckResult]: Stem: 1718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1712#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1713#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1723#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1731#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1734#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1758#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1755#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1757#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1756#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1754#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1753#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1752#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1751#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1735#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1721#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1722#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1744#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1745#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1725#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1726#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1741#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1733#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1729#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1730#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1750#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1727#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1728#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1748#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1747#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1746#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1740#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1739#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1738#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1736#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1719#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1720#L511-4 [2019-10-22 09:01:22,436 INFO L793 eck$LassoCheckResult]: Loop: 1720#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1714#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1715#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1724#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1720#L511-4 [2019-10-22 09:01:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -43865248, now seen corresponding path program 6 times [2019-10-22 09:01:22,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007156570] [2019-10-22 09:01:22,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 5 times [2019-10-22 09:01:22,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423395096] [2019-10-22 09:01:22,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,483 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -345387609, now seen corresponding path program 7 times [2019-10-22 09:01:22,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909099207] [2019-10-22 09:01:22,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:23,551 WARN L191 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 207 [2019-10-22 09:01:23,726 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-22 09:01:23,728 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:23,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:23,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:23,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:23,729 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:23,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:23,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:23,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:23,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration7_Lasso [2019-10-22 09:01:23,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:23,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:23,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:23,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,302 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-10-22 09:01:24,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:24,652 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-22 09:01:30,275 WARN L191 SmtUtils]: Spent 5.58 s on a formula simplification. DAG size of input: 298 DAG size of output: 150 [2019-10-22 09:01:30,532 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:30,566 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:30,566 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:30,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:30,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:30,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:30,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,569 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:30,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:30,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:30,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,572 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:30,572 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:30,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:30,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:30,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:30,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:30,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:30,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:30,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:30,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:30,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:30,588 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:30,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:30,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:30,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:30,589 INFO L202 nArgumentSynthesizer]: 108 stem disjuncts [2019-10-22 09:01:30,589 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-10-22 09:01:30,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:30,679 INFO L400 nArgumentSynthesizer]: We have 904 Motzkin's Theorem applications. [2019-10-22 09:01:30,679 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-10-22 09:01:31,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:31,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,385 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,409 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:31,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:31,445 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:31,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:31,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:31,446 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:31,447 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_5, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_5 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2019-10-22 09:01:31,568 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-10-22 09:01:31,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:31,629 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 [2019-10-22 09:01:31,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:01:31,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 55 states and 61 transitions. Complement of second has 5 states. [2019-10-22 09:01:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:01:31,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2019-10-22 09:01:31,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:31,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:31,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:01:31,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:01:31,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 55 states and 61 transitions. Complement of second has 5 states. [2019-10-22 09:01:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:01:31,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2019-10-22 09:01:31,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:31,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:31,784 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:01:31,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:01:31,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 80 states and 91 transitions. Complement of second has 4 states. [2019-10-22 09:01:31,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-10-22 09:01:31,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 36 letters. Loop has 4 letters. [2019-10-22 09:01:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 4 letters. [2019-10-22 09:01:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 36 letters. Loop has 8 letters. [2019-10-22 09:01:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:31,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2019-10-22 09:01:31,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:31,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2019-10-22 09:01:31,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:31,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:31,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:31,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:31,807 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:31,808 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:31,808 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:31,808 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:31,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:31,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:31,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:31,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:31 BoogieIcfgContainer [2019-10-22 09:01:31,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:31,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:31,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:31,818 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:31,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:09" (3/4) ... [2019-10-22 09:01:31,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:31,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:31,823 INFO L168 Benchmark]: Toolchain (without parser) took 23820.47 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 553.1 MB). Free memory was 940.4 MB in the beginning and 907.4 MB in the end (delta: 33.0 MB). Peak memory consumption was 586.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,824 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:31,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,826 INFO L168 Benchmark]: Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,828 INFO L168 Benchmark]: RCFGBuilder took 343.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,829 INFO L168 Benchmark]: BuchiAutomizer took 22768.77 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 1.1 GB in the beginning and 907.4 MB in the end (delta: 184.4 MB). Peak memory consumption was 600.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:31,830 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 1.6 GB. Free memory is still 907.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:31,833 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 343.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22768.77 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 1.1 GB in the beginning and 907.4 MB in the end (delta: 184.4 MB). Peak memory consumption was 600.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 ms. Allocated memory is still 1.6 GB. Free memory is still 907.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function -1 * reject + -1 * i + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 5 * unknown-#length-unknown[reject] and consists of 9 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.6s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 20.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 144 SDtfs, 264 SDslu, 172 SDs, 0 SdLazy, 214 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf99 lsp95 ukn77 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp96 dnf1781 smp66 tf100 neg87 sie130 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 787ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 108 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 904 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! Received shutdown request...